TSTP Solution File: SWC373+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC373+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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 03:12:13 EDT 2024
% Result : Theorem 9.94s 2.18s
% Output : CNFRefutation 9.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 13
% Syntax : Number of formulae : 68 ( 24 unt; 0 def)
% Number of atoms : 281 ( 60 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 324 ( 111 ~; 93 |; 94 &)
% ( 4 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 122 ( 0 sgn 63 !; 41 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( rearsegP(X0,X1)
<=> ? [X2] :
( app(X2,X1) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax6) ).
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax7) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax26) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( segmentP(X1,X0)
| ~ rearsegP(X3,X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( segmentP(X1,X0)
| ~ rearsegP(X3,X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f102,plain,
! [X0] :
( ! [X1] :
( ( rearsegP(X0,X1)
<=> ? [X2] :
( app(X2,X1) = X0
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f103,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f201,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ segmentP(X1,X0)
& rearsegP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ segmentP(X1,X0)
& rearsegP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f249,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) ) )
& ( ? [X2] :
( app(X2,X1) = X0
& ssList(X2) )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f102]) ).
fof(f250,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) ) )
& ( ? [X3] :
( app(X3,X1) = X0
& ssList(X3) )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f249]) ).
fof(f251,plain,
! [X0,X1] :
( ? [X3] :
( app(X3,X1) = X0
& ssList(X3) )
=> ( app(sK12(X0,X1),X1) = X0
& ssList(sK12(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) ) )
& ( ( app(sK12(X0,X1),X1) = X0
& ssList(sK12(X0,X1)) )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12])],[f250,f251]) ).
fof(f253,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f103]) ).
fof(f254,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f253]) ).
fof(f255,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK13(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK13(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f256,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK13(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK13(X0,X1),X1),sK14(X0,X1)) = X0
& ssList(sK14(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f257,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK13(X0,X1),X1),sK14(X0,X1)) = X0
& ssList(sK14(X0,X1))
& ssList(sK13(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13,sK14])],[f254,f256,f255]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ segmentP(X1,X0)
& rearsegP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ segmentP(X1,sK53)
& rearsegP(X3,X2)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ segmentP(X1,sK53)
& rearsegP(X3,X2)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ~ segmentP(sK54,sK53)
& rearsegP(X3,X2)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ~ segmentP(sK54,sK53)
& rearsegP(X3,X2)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ~ segmentP(sK54,sK53)
& rearsegP(X3,sK55)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ~ segmentP(sK54,sK53)
& rearsegP(X3,sK55)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ~ segmentP(sK54,sK53)
& rearsegP(sK56,sK55)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ~ segmentP(sK54,sK53)
& rearsegP(sK56,sK55)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56])],[f222,f346,f345,f344,f343]) ).
fof(f363,plain,
! [X0,X1] :
( ssList(sK12(X0,X1))
| ~ rearsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f252]) ).
fof(f364,plain,
! [X0,X1] :
( app(sK12(X0,X1),X1) = X0
| ~ rearsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f252]) ).
fof(f369,plain,
! [X2,X3,X0,X1] :
( segmentP(X0,X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f257]) ).
fof(f440,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f452,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f533,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f201]) ).
fof(f547,plain,
ssList(sK53),
inference(cnf_transformation,[],[f347]) ).
fof(f548,plain,
ssList(sK54),
inference(cnf_transformation,[],[f347]) ).
fof(f551,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f347]) ).
fof(f552,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f347]) ).
fof(f553,plain,
rearsegP(sK56,sK55),
inference(cnf_transformation,[],[f347]) ).
fof(f554,plain,
~ segmentP(sK54,sK53),
inference(cnf_transformation,[],[f347]) ).
fof(f555,plain,
~ segmentP(sK56,sK55),
inference(definition_unfolding,[],[f554,f551,f552]) ).
fof(f556,plain,
ssList(sK56),
inference(definition_unfolding,[],[f548,f551]) ).
fof(f557,plain,
ssList(sK55),
inference(definition_unfolding,[],[f547,f552]) ).
fof(f563,plain,
! [X2,X3,X1] :
( segmentP(app(app(X2,X1),X3),X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(app(X2,X1),X3)) ),
inference(equality_resolution,[],[f369]) ).
cnf(c_65,plain,
( ~ rearsegP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| app(sK12(X0,X1),X1) = X0 ),
inference(cnf_transformation,[],[f364]) ).
cnf(c_66,plain,
( ~ rearsegP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ssList(sK12(X0,X1)) ),
inference(cnf_transformation,[],[f363]) ).
cnf(c_67,plain,
( ~ ssList(app(app(X0,X1),X2))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| segmentP(app(app(X0,X1),X2),X1) ),
inference(cnf_transformation,[],[f563]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f440]) ).
cnf(c_153,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f452]) ).
cnf(c_232,plain,
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f533]) ).
cnf(c_246,negated_conjecture,
~ segmentP(sK56,sK55),
inference(cnf_transformation,[],[f555]) ).
cnf(c_247,negated_conjecture,
rearsegP(sK56,sK55),
inference(cnf_transformation,[],[f553]) ).
cnf(c_250,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f556]) ).
cnf(c_251,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f557]) ).
cnf(c_8773,negated_conjecture,
ssList(sK55),
inference(demodulation,[status(thm)],[c_251]) ).
cnf(c_8774,negated_conjecture,
ssList(sK56),
inference(demodulation,[status(thm)],[c_250]) ).
cnf(c_8775,negated_conjecture,
rearsegP(sK56,sK55),
inference(demodulation,[status(thm)],[c_247]) ).
cnf(c_8776,negated_conjecture,
~ segmentP(sK56,sK55),
inference(demodulation,[status(thm)],[c_246]) ).
cnf(c_11970,plain,
app(sK56,nil) = sK56,
inference(superposition,[status(thm)],[c_8774,c_232]) ).
cnf(c_16189,plain,
( ~ ssList(sK56)
| ~ ssList(sK55)
| app(sK12(sK56,sK55),sK55) = sK56 ),
inference(superposition,[status(thm)],[c_8775,c_65]) ).
cnf(c_16201,plain,
app(sK12(sK56,sK55),sK55) = sK56,
inference(forward_subsumption_resolution,[status(thm)],[c_16189,c_8773,c_8774]) ).
cnf(c_19716,plain,
( ~ ssList(app(X0,X1))
| ~ ssList(X2)
| ssList(app(app(X0,X1),X2)) ),
inference(instantiation,[status(thm)],[c_153]) ).
cnf(c_23569,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| segmentP(app(app(X0,X1),X2),X1) ),
inference(global_subsumption_just,[status(thm)],[c_67,c_153,c_67,c_19716]) ).
cnf(c_23595,plain,
( ~ ssList(sK12(sK56,sK55))
| ~ ssList(X0)
| ~ ssList(sK55)
| segmentP(app(sK56,X0),sK55) ),
inference(superposition,[status(thm)],[c_16201,c_23569]) ).
cnf(c_23633,plain,
( ~ ssList(sK12(sK56,sK55))
| ~ ssList(X0)
| segmentP(app(sK56,X0),sK55) ),
inference(forward_subsumption_resolution,[status(thm)],[c_23595,c_8773]) ).
cnf(c_25883,plain,
( ~ ssList(sK12(sK56,sK55))
| ~ ssList(nil)
| segmentP(sK56,sK55) ),
inference(superposition,[status(thm)],[c_11970,c_23633]) ).
cnf(c_25888,plain,
~ ssList(sK12(sK56,sK55)),
inference(forward_subsumption_resolution,[status(thm)],[c_25883,c_8776,c_141]) ).
cnf(c_25889,plain,
( ~ rearsegP(sK56,sK55)
| ~ ssList(sK56)
| ~ ssList(sK55) ),
inference(superposition,[status(thm)],[c_66,c_25888]) ).
cnf(c_25890,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_25889,c_8773,c_8774,c_8775]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWC373+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n023.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 : Thu May 2 23:50:09 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.22/0.48 Running first-order theorem proving
% 0.22/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 9.94/2.18 % SZS status Started for theBenchmark.p
% 9.94/2.18 % SZS status Theorem for theBenchmark.p
% 9.94/2.18
% 9.94/2.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 9.94/2.18
% 9.94/2.18 ------ iProver source info
% 9.94/2.18
% 9.94/2.18 git: date: 2024-05-02 19:28:25 +0000
% 9.94/2.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 9.94/2.18 git: non_committed_changes: false
% 9.94/2.18
% 9.94/2.18 ------ Parsing...
% 9.94/2.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 9.94/2.18
% 9.94/2.18 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 9.94/2.18
% 9.94/2.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 9.94/2.18
% 9.94/2.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 9.94/2.18 ------ Proving...
% 9.94/2.18 ------ Problem Properties
% 9.94/2.18
% 9.94/2.18
% 9.94/2.18 clauses 184
% 9.94/2.18 conjectures 4
% 9.94/2.18 EPR 53
% 9.94/2.18 Horn 116
% 9.94/2.18 unary 20
% 9.94/2.18 binary 40
% 9.94/2.18 lits 622
% 9.94/2.18 lits eq 78
% 9.94/2.18 fd_pure 0
% 9.94/2.18 fd_pseudo 0
% 9.94/2.18 fd_cond 21
% 9.94/2.18 fd_pseudo_cond 14
% 9.94/2.18 AC symbols 0
% 9.94/2.18
% 9.94/2.18 ------ Schedule dynamic 5 is on
% 9.94/2.18
% 9.94/2.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 9.94/2.18
% 9.94/2.18
% 9.94/2.18 ------
% 9.94/2.18 Current options:
% 9.94/2.18 ------
% 9.94/2.18
% 9.94/2.18
% 9.94/2.18
% 9.94/2.18
% 9.94/2.18 ------ Proving...
% 9.94/2.18
% 9.94/2.18
% 9.94/2.18 % SZS status Theorem for theBenchmark.p
% 9.94/2.18
% 9.94/2.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 9.94/2.18
% 9.94/2.18
%------------------------------------------------------------------------------