TSTP Solution File: NUM434+3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM434+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n012.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:16 EDT 2024
% Result : Theorem 2.89s 1.13s
% Output : CNFRefutation 2.89s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f24,axiom,
( sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& ? [X0] :
( sdtasdt0(sdtasdt0(xp,xq),X0) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X0) )
& sz00 != sdtasdt0(xp,xq) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1003) ).
fof(f25,conjecture,
? [X0] :
( sdtasdt0(sdtasdt0(xp,xq),X0) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f26,negated_conjecture,
~ ? [X0] :
( sdtasdt0(sdtasdt0(xp,xq),X0) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X0) ),
inference(negated_conjecture,[],[f25]) ).
fof(f59,plain,
! [X0] :
( sdtasdt0(sdtasdt0(xp,xq),X0) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f66,plain,
( ? [X0] :
( sdtasdt0(sdtasdt0(xp,xq),X0) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X0) )
=> ( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(sdtasdt0(xp,xq),sK1)
& aInteger0(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f67,plain,
( sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& sdtpldt0(xa,smndt0(xb)) = sdtasdt0(sdtasdt0(xp,xq),sK1)
& aInteger0(sK1)
& sz00 != sdtasdt0(xp,xq) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f24,f66]) ).
fof(f107,plain,
aInteger0(sK1),
inference(cnf_transformation,[],[f67]) ).
fof(f108,plain,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(sdtasdt0(xp,xq),sK1),
inference(cnf_transformation,[],[f67]) ).
fof(f111,plain,
! [X0] :
( sdtasdt0(sdtasdt0(xp,xq),X0) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f59]) ).
cnf(c_89,plain,
sdtasdt0(sdtasdt0(xp,xq),sK1) = sdtpldt0(xa,smndt0(xb)),
inference(cnf_transformation,[],[f108]) ).
cnf(c_90,plain,
aInteger0(sK1),
inference(cnf_transformation,[],[f107]) ).
cnf(c_92,negated_conjecture,
( sdtasdt0(sdtasdt0(xp,xq),X0) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f111]) ).
cnf(c_800,plain,
sdtasdt0(xp,xq) = sP0_iProver_def,
definition ).
cnf(c_801,plain,
smndt0(xb) = sP1_iProver_def,
definition ).
cnf(c_802,plain,
sdtpldt0(xa,sP1_iProver_def) = sP2_iProver_def,
definition ).
cnf(c_803,negated_conjecture,
( sdtasdt0(sP0_iProver_def,X0) != sP2_iProver_def
| ~ aInteger0(X0) ),
inference(demodulation,[status(thm)],[c_92,c_801,c_802,c_800]) ).
cnf(c_1941,plain,
sdtasdt0(sP0_iProver_def,sK1) = sP2_iProver_def,
inference(light_normalisation,[status(thm)],[c_89,c_800,c_801,c_802]) ).
cnf(c_1943,plain,
~ aInteger0(sK1),
inference(superposition,[status(thm)],[c_1941,c_803]) ).
cnf(c_1944,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1943,c_90]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NUM434+3 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n012.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 19:19:40 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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
% 2.89/1.13 % SZS status Started for theBenchmark.p
% 2.89/1.13 % SZS status Theorem for theBenchmark.p
% 2.89/1.13
% 2.89/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.89/1.13
% 2.89/1.13 ------ iProver source info
% 2.89/1.13
% 2.89/1.13 git: date: 2024-05-02 19:28:25 +0000
% 2.89/1.13 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.89/1.13 git: non_committed_changes: false
% 2.89/1.13
% 2.89/1.13 ------ Parsing...
% 2.89/1.13 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.89/1.13
% 2.89/1.13 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 2.89/1.13
% 2.89/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.89/1.13
% 2.89/1.13 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.89/1.13 ------ Proving...
% 2.89/1.13 ------ Problem Properties
% 2.89/1.13
% 2.89/1.13
% 2.89/1.13 clauses 47
% 2.89/1.13 conjectures 1
% 2.89/1.13 EPR 14
% 2.89/1.13 Horn 40
% 2.89/1.13 unary 16
% 2.89/1.13 binary 13
% 2.89/1.13 lits 118
% 2.89/1.13 lits eq 34
% 2.89/1.13 fd_pure 0
% 2.89/1.13 fd_pseudo 0
% 2.89/1.13 fd_cond 7
% 2.89/1.13 fd_pseudo_cond 0
% 2.89/1.13 AC symbols 0
% 2.89/1.13
% 2.89/1.13 ------ Schedule dynamic 5 is on
% 2.89/1.13
% 2.89/1.13 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.89/1.13
% 2.89/1.13
% 2.89/1.13 ------
% 2.89/1.13 Current options:
% 2.89/1.13 ------
% 2.89/1.13
% 2.89/1.13
% 2.89/1.13
% 2.89/1.13
% 2.89/1.13 ------ Proving...
% 2.89/1.13
% 2.89/1.13
% 2.89/1.13 % SZS status Theorem for theBenchmark.p
% 2.89/1.13
% 2.89/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.89/1.13
% 2.89/1.13
%------------------------------------------------------------------------------