TSTP Solution File: NUM423+3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM423+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri May 3 02:49:13 EDT 2024
% Result : Theorem 3.12s 1.20s
% Output : CNFRefutation 3.12s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
aInteger0(sz00),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntZero) ).
fof(f10,axiom,
! [X0] :
( aInteger0(X0)
=> ( sz00 = sdtpldt0(smndt0(X0),X0)
& sz00 = sdtpldt0(X0,smndt0(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddNeg) ).
fof(f15,axiom,
! [X0] :
( aInteger0(X0)
=> ( sz00 = sdtasdt0(sz00,X0)
& sz00 = sdtasdt0(X0,sz00) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulZero) ).
fof(f20,axiom,
( sz00 != xq
& aInteger0(xq)
& aInteger0(xa) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__671) ).
fof(f21,conjecture,
( sdteqdtlpzmzozddtrp0(xa,xa,xq)
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa)))
| ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xa))
& aInteger0(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f22,negated_conjecture,
~ ( sdteqdtlpzmzozddtrp0(xa,xa,xq)
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa)))
| ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xa))
& aInteger0(X0) ) ),
inference(negated_conjecture,[],[f21]) ).
fof(f34,plain,
! [X0] :
( ( sz00 = sdtpldt0(smndt0(X0),X0)
& sz00 = sdtpldt0(X0,smndt0(X0)) )
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f42,plain,
! [X0] :
( ( sz00 = sdtasdt0(sz00,X0)
& sz00 = sdtasdt0(X0,sz00) )
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f49,plain,
( ~ sdteqdtlpzmzozddtrp0(xa,xa,xq)
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa)))
& ! [X0] :
( sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xa))
| ~ aInteger0(X0) ) ),
inference(ennf_transformation,[],[f22]) ).
fof(f56,plain,
aInteger0(sz00),
inference(cnf_transformation,[],[f2]) ).
fof(f65,plain,
! [X0] :
( sz00 = sdtpldt0(X0,smndt0(X0))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f73,plain,
! [X0] :
( sz00 = sdtasdt0(X0,sz00)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f42]) ).
fof(f85,plain,
aInteger0(xa),
inference(cnf_transformation,[],[f20]) ).
fof(f86,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f20]) ).
fof(f88,plain,
! [X0] :
( sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xa))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f49]) ).
cnf(c_49,plain,
aInteger0(sz00),
inference(cnf_transformation,[],[f56]) ).
cnf(c_59,plain,
( ~ aInteger0(X0)
| sdtpldt0(X0,smndt0(X0)) = sz00 ),
inference(cnf_transformation,[],[f65]) ).
cnf(c_67,plain,
( ~ aInteger0(X0)
| sdtasdt0(X0,sz00) = sz00 ),
inference(cnf_transformation,[],[f73]) ).
cnf(c_79,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f86]) ).
cnf(c_80,plain,
aInteger0(xa),
inference(cnf_transformation,[],[f85]) ).
cnf(c_83,negated_conjecture,
( sdtpldt0(xa,smndt0(xa)) != sdtasdt0(xq,X0)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f88]) ).
cnf(c_797,plain,
smndt0(xa) = sP0_iProver_def,
definition ).
cnf(c_798,plain,
sdtpldt0(xa,sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_799,negated_conjecture,
( sP1_iProver_def != sdtasdt0(xq,X0)
| ~ aInteger0(X0) ),
inference(demodulation,[status(thm)],[c_83,c_797,c_798]) ).
cnf(c_1253,plain,
sdtasdt0(xq,sz00) = sz00,
inference(superposition,[status(thm)],[c_79,c_67]) ).
cnf(c_1386,plain,
( sz00 != sP1_iProver_def
| ~ aInteger0(sz00) ),
inference(superposition,[status(thm)],[c_1253,c_799]) ).
cnf(c_1387,plain,
sz00 != sP1_iProver_def,
inference(forward_subsumption_resolution,[status(thm)],[c_1386,c_49]) ).
cnf(c_1456,plain,
sdtpldt0(xa,smndt0(xa)) = sz00,
inference(superposition,[status(thm)],[c_80,c_59]) ).
cnf(c_1459,plain,
sz00 = sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_1456,c_797,c_798]) ).
cnf(c_1504,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1459,c_1387]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM423+3 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu May 2 19:47:06 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.12/1.20 % SZS status Started for theBenchmark.p
% 3.12/1.20 % SZS status Theorem for theBenchmark.p
% 3.12/1.20
% 3.12/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.12/1.20
% 3.12/1.20 ------ iProver source info
% 3.12/1.20
% 3.12/1.20 git: date: 2024-05-02 19:28:25 +0000
% 3.12/1.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.12/1.20 git: non_committed_changes: false
% 3.12/1.20
% 3.12/1.20 ------ Parsing...
% 3.12/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.12/1.20
% 3.12/1.20 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e
% 3.12/1.20
% 3.12/1.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.12/1.20
% 3.12/1.20 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.12/1.20 ------ Proving...
% 3.12/1.20 ------ Problem Properties
% 3.12/1.20
% 3.12/1.20
% 3.12/1.20 clauses 30
% 3.12/1.20 conjectures 1
% 3.12/1.20 EPR 5
% 3.12/1.20 Horn 27
% 3.12/1.20 unary 7
% 3.12/1.20 binary 12
% 3.12/1.20 lits 72
% 3.12/1.20 lits eq 26
% 3.12/1.20 fd_pure 0
% 3.12/1.20 fd_pseudo 0
% 3.12/1.20 fd_cond 3
% 3.12/1.20 fd_pseudo_cond 0
% 3.12/1.20 AC symbols 0
% 3.12/1.20
% 3.12/1.20 ------ Schedule dynamic 5 is on
% 3.12/1.20
% 3.12/1.20 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.12/1.20
% 3.12/1.20
% 3.12/1.20 ------
% 3.12/1.20 Current options:
% 3.12/1.20 ------
% 3.12/1.20
% 3.12/1.20
% 3.12/1.20
% 3.12/1.20
% 3.12/1.20 ------ Proving...
% 3.12/1.20
% 3.12/1.20
% 3.12/1.20 % SZS status Theorem for theBenchmark.p
% 3.12/1.20
% 3.12/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.12/1.20
% 3.12/1.20
%------------------------------------------------------------------------------