TSTP Solution File: PRO012+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : PRO012+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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:54:18 EDT 2024
% Result : Theorem 2.89s 1.15s
% Output : CNFRefutation 2.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 43 ( 5 unt; 0 def)
% Number of atoms : 198 ( 14 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 241 ( 86 ~; 85 |; 60 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-1 aty)
% Number of variables : 95 ( 0 sgn 49 !; 23 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2,X3] :
( ( min_precedes(X1,X2,X3)
& min_precedes(X0,X1,X3) )
=> min_precedes(X0,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos) ).
fof(f33,axiom,
! [X95] :
( occurrence_of(X95,tptp0)
=> ? [X96,X97,X98] :
( ! [X99] :
( min_precedes(X96,X99,tptp0)
=> ( X98 = X99
| X97 = X99 ) )
& min_precedes(X97,X98,tptp0)
& ( occurrence_of(X98,tptp1)
| occurrence_of(X98,tptp2) )
& min_precedes(X96,X97,tptp0)
& occurrence_of(X97,tptp4)
& root_occ(X96,X95)
& occurrence_of(X96,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
fof(f46,conjecture,
! [X100] :
( occurrence_of(X100,tptp0)
=> ? [X101,X102] :
( min_precedes(X101,X102,tptp0)
& ( occurrence_of(X102,tptp1)
| occurrence_of(X102,tptp2) )
& root_occ(X101,X100)
& occurrence_of(X101,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f47,negated_conjecture,
~ ! [X100] :
( occurrence_of(X100,tptp0)
=> ? [X101,X102] :
( min_precedes(X101,X102,tptp0)
& ( occurrence_of(X102,tptp1)
| occurrence_of(X102,tptp2) )
& root_occ(X101,X100)
& occurrence_of(X101,tptp3) ) ),
inference(negated_conjecture,[],[f46]) ).
fof(f79,plain,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2,X3] :
( ! [X4] :
( min_precedes(X1,X4,tptp0)
=> ( X3 = X4
| X2 = X4 ) )
& min_precedes(X2,X3,tptp0)
& ( occurrence_of(X3,tptp1)
| occurrence_of(X3,tptp2) )
& min_precedes(X1,X2,tptp0)
& occurrence_of(X2,tptp4)
& root_occ(X1,X0)
& occurrence_of(X1,tptp3) ) ),
inference(rectify,[],[f33]) ).
fof(f80,plain,
~ ! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( min_precedes(X1,X2,tptp0)
& ( occurrence_of(X2,tptp1)
| occurrence_of(X2,tptp2) )
& root_occ(X1,X0)
& occurrence_of(X1,tptp3) ) ),
inference(rectify,[],[f47]) ).
fof(f83,plain,
! [X0,X1,X2,X3] :
( min_precedes(X0,X2,X3)
| ~ min_precedes(X1,X2,X3)
| ~ min_precedes(X0,X1,X3) ),
inference(ennf_transformation,[],[f1]) ).
fof(f84,plain,
! [X0,X1,X2,X3] :
( min_precedes(X0,X2,X3)
| ~ min_precedes(X1,X2,X3)
| ~ min_precedes(X0,X1,X3) ),
inference(flattening,[],[f83]) ).
fof(f125,plain,
! [X0] :
( ? [X1,X2,X3] :
( ! [X4] :
( X3 = X4
| X2 = X4
| ~ min_precedes(X1,X4,tptp0) )
& min_precedes(X2,X3,tptp0)
& ( occurrence_of(X3,tptp1)
| occurrence_of(X3,tptp2) )
& min_precedes(X1,X2,tptp0)
& occurrence_of(X2,tptp4)
& root_occ(X1,X0)
& occurrence_of(X1,tptp3) )
| ~ occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f79]) ).
fof(f126,plain,
! [X0] :
( ? [X1,X2,X3] :
( ! [X4] :
( X3 = X4
| X2 = X4
| ~ min_precedes(X1,X4,tptp0) )
& min_precedes(X2,X3,tptp0)
& ( occurrence_of(X3,tptp1)
| occurrence_of(X3,tptp2) )
& min_precedes(X1,X2,tptp0)
& occurrence_of(X2,tptp4)
& root_occ(X1,X0)
& occurrence_of(X1,tptp3) )
| ~ occurrence_of(X0,tptp0) ),
inference(flattening,[],[f125]) ).
fof(f127,plain,
? [X0] :
( ! [X1,X2] :
( ~ min_precedes(X1,X2,tptp0)
| ( ~ occurrence_of(X2,tptp1)
& ~ occurrence_of(X2,tptp2) )
| ~ root_occ(X1,X0)
| ~ occurrence_of(X1,tptp3) )
& occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f80]) ).
fof(f163,plain,
! [X0] :
( ? [X1,X2,X3] :
( ! [X4] :
( X3 = X4
| X2 = X4
| ~ min_precedes(X1,X4,tptp0) )
& min_precedes(X2,X3,tptp0)
& ( occurrence_of(X3,tptp1)
| occurrence_of(X3,tptp2) )
& min_precedes(X1,X2,tptp0)
& occurrence_of(X2,tptp4)
& root_occ(X1,X0)
& occurrence_of(X1,tptp3) )
=> ( ! [X4] :
( sK16(X0) = X4
| sK15(X0) = X4
| ~ min_precedes(sK14(X0),X4,tptp0) )
& min_precedes(sK15(X0),sK16(X0),tptp0)
& ( occurrence_of(sK16(X0),tptp1)
| occurrence_of(sK16(X0),tptp2) )
& min_precedes(sK14(X0),sK15(X0),tptp0)
& occurrence_of(sK15(X0),tptp4)
& root_occ(sK14(X0),X0)
& occurrence_of(sK14(X0),tptp3) ) ),
introduced(choice_axiom,[]) ).
fof(f164,plain,
! [X0] :
( ( ! [X4] :
( sK16(X0) = X4
| sK15(X0) = X4
| ~ min_precedes(sK14(X0),X4,tptp0) )
& min_precedes(sK15(X0),sK16(X0),tptp0)
& ( occurrence_of(sK16(X0),tptp1)
| occurrence_of(sK16(X0),tptp2) )
& min_precedes(sK14(X0),sK15(X0),tptp0)
& occurrence_of(sK15(X0),tptp4)
& root_occ(sK14(X0),X0)
& occurrence_of(sK14(X0),tptp3) )
| ~ occurrence_of(X0,tptp0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK14,sK15,sK16])],[f126,f163]) ).
fof(f165,plain,
( ? [X0] :
( ! [X1,X2] :
( ~ min_precedes(X1,X2,tptp0)
| ( ~ occurrence_of(X2,tptp1)
& ~ occurrence_of(X2,tptp2) )
| ~ root_occ(X1,X0)
| ~ occurrence_of(X1,tptp3) )
& occurrence_of(X0,tptp0) )
=> ( ! [X2,X1] :
( ~ min_precedes(X1,X2,tptp0)
| ( ~ occurrence_of(X2,tptp1)
& ~ occurrence_of(X2,tptp2) )
| ~ root_occ(X1,sK17)
| ~ occurrence_of(X1,tptp3) )
& occurrence_of(sK17,tptp0) ) ),
introduced(choice_axiom,[]) ).
fof(f166,plain,
( ! [X1,X2] :
( ~ min_precedes(X1,X2,tptp0)
| ( ~ occurrence_of(X2,tptp1)
& ~ occurrence_of(X2,tptp2) )
| ~ root_occ(X1,sK17)
| ~ occurrence_of(X1,tptp3) )
& occurrence_of(sK17,tptp0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK17])],[f127,f165]) ).
fof(f167,plain,
! [X2,X3,X0,X1] :
( min_precedes(X0,X2,X3)
| ~ min_precedes(X1,X2,X3)
| ~ min_precedes(X0,X1,X3) ),
inference(cnf_transformation,[],[f84]) ).
fof(f227,plain,
! [X0] :
( occurrence_of(sK14(X0),tptp3)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f164]) ).
fof(f228,plain,
! [X0] :
( root_occ(sK14(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f164]) ).
fof(f230,plain,
! [X0] :
( min_precedes(sK14(X0),sK15(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f164]) ).
fof(f231,plain,
! [X0] :
( occurrence_of(sK16(X0),tptp1)
| occurrence_of(sK16(X0),tptp2)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f164]) ).
fof(f232,plain,
! [X0] :
( min_precedes(sK15(X0),sK16(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f164]) ).
fof(f246,plain,
occurrence_of(sK17,tptp0),
inference(cnf_transformation,[],[f166]) ).
fof(f247,plain,
! [X2,X1] :
( ~ min_precedes(X1,X2,tptp0)
| ~ occurrence_of(X2,tptp2)
| ~ root_occ(X1,sK17)
| ~ occurrence_of(X1,tptp3) ),
inference(cnf_transformation,[],[f166]) ).
fof(f248,plain,
! [X2,X1] :
( ~ min_precedes(X1,X2,tptp0)
| ~ occurrence_of(X2,tptp1)
| ~ root_occ(X1,sK17)
| ~ occurrence_of(X1,tptp3) ),
inference(cnf_transformation,[],[f166]) ).
cnf(c_49,plain,
( ~ min_precedes(X0,X1,X2)
| ~ min_precedes(X1,X3,X2)
| min_precedes(X0,X3,X2) ),
inference(cnf_transformation,[],[f167]) ).
cnf(c_110,plain,
( ~ occurrence_of(X0,tptp0)
| min_precedes(sK15(X0),sK16(X0),tptp0) ),
inference(cnf_transformation,[],[f232]) ).
cnf(c_111,plain,
( ~ occurrence_of(X0,tptp0)
| occurrence_of(sK16(X0),tptp1)
| occurrence_of(sK16(X0),tptp2) ),
inference(cnf_transformation,[],[f231]) ).
cnf(c_112,plain,
( ~ occurrence_of(X0,tptp0)
| min_precedes(sK14(X0),sK15(X0),tptp0) ),
inference(cnf_transformation,[],[f230]) ).
cnf(c_114,plain,
( ~ occurrence_of(X0,tptp0)
| root_occ(sK14(X0),X0) ),
inference(cnf_transformation,[],[f228]) ).
cnf(c_115,plain,
( ~ occurrence_of(X0,tptp0)
| occurrence_of(sK14(X0),tptp3) ),
inference(cnf_transformation,[],[f227]) ).
cnf(c_128,negated_conjecture,
( ~ min_precedes(X0,X1,tptp0)
| ~ root_occ(X0,sK17)
| ~ occurrence_of(X0,tptp3)
| ~ occurrence_of(X1,tptp1) ),
inference(cnf_transformation,[],[f248]) ).
cnf(c_129,negated_conjecture,
( ~ min_precedes(X0,X1,tptp0)
| ~ root_occ(X0,sK17)
| ~ occurrence_of(X0,tptp3)
| ~ occurrence_of(X1,tptp2) ),
inference(cnf_transformation,[],[f247]) ).
cnf(c_130,negated_conjecture,
occurrence_of(sK17,tptp0),
inference(cnf_transformation,[],[f246]) ).
cnf(c_5184,negated_conjecture,
occurrence_of(sK17,tptp0),
inference(demodulation,[status(thm)],[c_130]) ).
cnf(c_5185,negated_conjecture,
( ~ min_precedes(X0,X1,tptp0)
| ~ root_occ(X0,sK17)
| ~ occurrence_of(X0,tptp3)
| ~ occurrence_of(X1,tptp2) ),
inference(demodulation,[status(thm)],[c_129]) ).
cnf(c_5186,negated_conjecture,
( ~ min_precedes(X0,X1,tptp0)
| ~ root_occ(X0,sK17)
| ~ occurrence_of(X0,tptp3)
| ~ occurrence_of(X1,tptp1) ),
inference(demodulation,[status(thm)],[c_128]) ).
cnf(c_6616,plain,
( ~ min_precedes(sK15(X0),X1,tptp0)
| ~ occurrence_of(X0,tptp0)
| min_precedes(sK14(X0),X1,tptp0) ),
inference(superposition,[status(thm)],[c_112,c_49]) ).
cnf(c_6916,plain,
( ~ occurrence_of(X0,tptp0)
| min_precedes(sK14(X0),sK16(X0),tptp0) ),
inference(superposition,[status(thm)],[c_110,c_6616]) ).
cnf(c_7173,plain,
( ~ root_occ(sK14(X0),sK17)
| ~ occurrence_of(sK16(X0),tptp1)
| ~ occurrence_of(sK14(X0),tptp3)
| ~ occurrence_of(X0,tptp0) ),
inference(superposition,[status(thm)],[c_6916,c_5186]) ).
cnf(c_7174,plain,
( ~ root_occ(sK14(X0),sK17)
| ~ occurrence_of(sK16(X0),tptp2)
| ~ occurrence_of(sK14(X0),tptp3)
| ~ occurrence_of(X0,tptp0) ),
inference(superposition,[status(thm)],[c_6916,c_5185]) ).
cnf(c_7238,plain,
( ~ root_occ(sK14(X0),sK17)
| ~ occurrence_of(X0,tptp0) ),
inference(global_subsumption_just,[status(thm)],[c_7173,c_115,c_111,c_7174,c_7173]) ).
cnf(c_7245,plain,
~ occurrence_of(sK17,tptp0),
inference(superposition,[status(thm)],[c_114,c_7238]) ).
cnf(c_7246,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_7245,c_5184]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : PRO012+2 : TPTP v8.1.2. Released v4.0.0.
% 0.14/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 00:07:35 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.15 % SZS status Started for theBenchmark.p
% 2.89/1.15 % SZS status Theorem for theBenchmark.p
% 2.89/1.15
% 2.89/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.89/1.15
% 2.89/1.15 ------ iProver source info
% 2.89/1.15
% 2.89/1.15 git: date: 2024-05-02 19:28:25 +0000
% 2.89/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.89/1.15 git: non_committed_changes: false
% 2.89/1.15
% 2.89/1.15 ------ Parsing...
% 2.89/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.89/1.15
% 2.89/1.15 ------ 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: 1 0s sf_e pe_s pe_e
% 2.89/1.15
% 2.89/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.89/1.15
% 2.89/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.89/1.15 ------ Proving...
% 2.89/1.15 ------ Problem Properties
% 2.89/1.15
% 2.89/1.15
% 2.89/1.15 clauses 80
% 2.89/1.15 conjectures 3
% 2.89/1.15 EPR 44
% 2.89/1.15 Horn 65
% 2.89/1.15 unary 13
% 2.89/1.15 binary 38
% 2.89/1.15 lits 190
% 2.89/1.15 lits eq 12
% 2.89/1.15 fd_pure 0
% 2.89/1.15 fd_pseudo 0
% 2.89/1.15 fd_cond 0
% 2.89/1.15 fd_pseudo_cond 5
% 2.89/1.15 AC symbols 0
% 2.89/1.15
% 2.89/1.15 ------ Schedule dynamic 5 is on
% 2.89/1.15
% 2.89/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.89/1.15
% 2.89/1.15
% 2.89/1.15 ------
% 2.89/1.15 Current options:
% 2.89/1.15 ------
% 2.89/1.15
% 2.89/1.15
% 2.89/1.15
% 2.89/1.15
% 2.89/1.15 ------ Proving...
% 2.89/1.15
% 2.89/1.15
% 2.89/1.15 % SZS status Theorem for theBenchmark.p
% 2.89/1.15
% 2.89/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.89/1.15
% 3.05/1.15
%------------------------------------------------------------------------------