TSTP Solution File: SWC364+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC364+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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 : Thu Aug 31 20:42:52 EDT 2023
% Result : Theorem 3.56s 1.00s
% Output : CNFRefutation 3.56s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f604)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/benchmark/theBenchmark.p',ax7) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( segmentP(X1,X0)
| ! [X4] :
( ssItem(X4)
=> app(cons(X4,nil),X2) != X3 )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( segmentP(X1,X0)
| ! [X4] :
( ssItem(X4)
=> app(cons(X4,nil),X2) != X3 )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
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(f119,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f201,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ segmentP(X1,X0)
& ? [X4] :
( app(cons(X4,nil),X2) = X3
& ssItem(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ segmentP(X1,X0)
& ? [X4] :
( app(cons(X4,nil),X2) = X3
& ssItem(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
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] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ segmentP(X1,X0)
& ? [X4] :
( app(cons(X4,nil),X2) = X3
& ssItem(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ segmentP(X1,sK53)
& ? [X4] :
( app(cons(X4,nil),X2) = X3
& ssItem(X4) )
& neq(X1,nil) ) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ segmentP(X1,sK53)
& ? [X4] :
( app(cons(X4,nil),X2) = X3
& ssItem(X4) )
& neq(X1,nil) ) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK54,nil) )
| ( ~ segmentP(sK54,sK53)
& ? [X4] :
( app(cons(X4,nil),X2) = X3
& ssItem(X4) )
& neq(sK54,nil) ) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK54,nil) )
| ( ~ segmentP(sK54,sK53)
& ? [X4] :
( app(cons(X4,nil),X2) = X3
& ssItem(X4) )
& neq(sK54,nil) ) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK54,nil) )
| ( ~ segmentP(sK54,sK53)
& ? [X4] :
( app(cons(X4,nil),sK55) = X3
& ssItem(X4) )
& neq(sK54,nil) ) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK54,nil) )
| ( ~ segmentP(sK54,sK53)
& ? [X4] :
( app(cons(X4,nil),sK55) = X3
& ssItem(X4) )
& neq(sK54,nil) ) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK56,nil)
& neq(sK54,nil) )
| ( ~ segmentP(sK54,sK53)
& ? [X4] :
( app(cons(X4,nil),sK55) = sK56
& ssItem(X4) )
& neq(sK54,nil) ) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X4] :
( app(cons(X4,nil),sK55) = sK56
& ssItem(X4) )
=> ( sK56 = app(cons(sK57,nil),sK55)
& ssItem(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ( ( ~ neq(sK56,nil)
& neq(sK54,nil) )
| ( ~ segmentP(sK54,sK53)
& sK56 = app(cons(sK57,nil),sK55)
& ssItem(sK57)
& neq(sK54,nil) ) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57])],[f222,f347,f346,f345,f344,f343]) ).
fof(f370,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,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f441,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f534,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f201]) ).
fof(f548,plain,
ssList(sK53),
inference(cnf_transformation,[],[f348]) ).
fof(f549,plain,
ssList(sK54),
inference(cnf_transformation,[],[f348]) ).
fof(f552,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f348]) ).
fof(f553,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f348]) ).
fof(f559,plain,
( ~ neq(sK56,nil)
| ssItem(sK57) ),
inference(cnf_transformation,[],[f348]) ).
fof(f560,plain,
( ~ neq(sK56,nil)
| sK56 = app(cons(sK57,nil),sK55) ),
inference(cnf_transformation,[],[f348]) ).
fof(f561,plain,
( ~ neq(sK56,nil)
| ~ segmentP(sK54,sK53) ),
inference(cnf_transformation,[],[f348]) ).
fof(f562,plain,
( ~ neq(sK56,nil)
| ~ segmentP(sK56,sK55) ),
inference(definition_unfolding,[],[f561,f552,f553]) ).
fof(f568,plain,
ssList(sK56),
inference(definition_unfolding,[],[f549,f552]) ).
fof(f569,plain,
ssList(sK55),
inference(definition_unfolding,[],[f548,f553]) ).
fof(f575,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,[],[f370]) ).
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,[],[f575]) ).
cnf(c_140,plain,
( ~ ssItem(X0)
| ~ ssList(X1)
| ssList(cons(X0,X1)) ),
inference(cnf_transformation,[],[f440]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f441]) ).
cnf(c_232,plain,
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f534]) ).
cnf(c_246,negated_conjecture,
( ~ neq(sK56,nil)
| ~ segmentP(sK56,sK55) ),
inference(cnf_transformation,[],[f562]) ).
cnf(c_247,negated_conjecture,
( ~ neq(sK56,nil)
| app(cons(sK57,nil),sK55) = sK56 ),
inference(cnf_transformation,[],[f560]) ).
cnf(c_248,negated_conjecture,
( ~ neq(sK56,nil)
| ssItem(sK57) ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_252,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f604]) ).
cnf(c_255,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f568]) ).
cnf(c_256,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f569]) ).
cnf(c_385,negated_conjecture,
app(cons(sK57,nil),sK55) = sK56,
inference(global_subsumption_just,[status(thm)],[c_247,c_252,c_247]) ).
cnf(c_11627,plain,
app(sK56,nil) = sK56,
inference(superposition,[status(thm)],[c_255,c_232]) ).
cnf(c_11823,plain,
( ~ ssList(app(app(cons(sK57,nil),sK55),X0))
| ~ ssList(cons(sK57,nil))
| ~ ssList(X0)
| ~ ssList(sK55)
| segmentP(app(sK56,X0),sK55) ),
inference(superposition,[status(thm)],[c_385,c_67]) ).
cnf(c_12499,plain,
( ~ ssList(X0)
| ~ ssList(cons(sK57,nil))
| ~ ssList(app(app(cons(sK57,nil),sK55),X0))
| segmentP(app(sK56,X0),sK55) ),
inference(global_subsumption_just,[status(thm)],[c_11823,c_256,c_11823]) ).
cnf(c_12500,plain,
( ~ ssList(app(app(cons(sK57,nil),sK55),X0))
| ~ ssList(cons(sK57,nil))
| ~ ssList(X0)
| segmentP(app(sK56,X0),sK55) ),
inference(renaming,[status(thm)],[c_12499]) ).
cnf(c_12506,plain,
( ~ ssList(app(sK56,X0))
| ~ ssList(cons(sK57,nil))
| ~ ssList(X0)
| segmentP(app(sK56,X0),sK55) ),
inference(light_normalisation,[status(thm)],[c_12500,c_385]) ).
cnf(c_12515,plain,
( ~ ssList(cons(sK57,nil))
| ~ ssList(app(sK56,nil))
| ~ ssList(nil)
| segmentP(sK56,sK55) ),
inference(superposition,[status(thm)],[c_11627,c_12506]) ).
cnf(c_14924,plain,
( ~ ssList(cons(sK57,nil))
| ~ ssList(app(sK56,nil)) ),
inference(global_subsumption_just,[status(thm)],[c_12515,c_141,c_252,c_246,c_12515]) ).
cnf(c_14928,plain,
( ~ ssList(cons(sK57,nil))
| ~ ssList(sK56) ),
inference(light_normalisation,[status(thm)],[c_14924,c_11627]) ).
cnf(c_14931,plain,
~ ssList(cons(sK57,nil)),
inference(forward_subsumption_resolution,[status(thm)],[c_14928,c_255]) ).
cnf(c_14932,plain,
( ~ ssItem(sK57)
| ~ ssList(nil) ),
inference(superposition,[status(thm)],[c_140,c_14931]) ).
cnf(c_14933,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_14932,c_248,c_252,c_141]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.08 % Problem : SWC364+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.09 % Command : run_iprover %s %d THM
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Mon Aug 28 16:58:46 EDT 2023
% 0.13/0.28 % CPUTime :
% 0.13/0.36 Running first-order theorem proving
% 0.13/0.36 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.56/1.00 % SZS status Started for theBenchmark.p
% 3.56/1.00 % SZS status Theorem for theBenchmark.p
% 3.56/1.00
% 3.56/1.00 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.56/1.00
% 3.56/1.00 ------ iProver source info
% 3.56/1.00
% 3.56/1.00 git: date: 2023-05-31 18:12:56 +0000
% 3.56/1.00 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.56/1.00 git: non_committed_changes: false
% 3.56/1.00 git: last_make_outside_of_git: false
% 3.56/1.00
% 3.56/1.00 ------ Parsing...
% 3.56/1.00 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.56/1.00
% 3.56/1.00 ------ 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: 5 0s sf_e pe_s pe_e
% 3.56/1.00
% 3.56/1.00 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.56/1.00
% 3.56/1.00 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.56/1.00 ------ Proving...
% 3.56/1.00 ------ Problem Properties
% 3.56/1.00
% 3.56/1.00
% 3.56/1.00 clauses 186
% 3.56/1.00 conjectures 5
% 3.56/1.00 EPR 54
% 3.56/1.00 Horn 118
% 3.56/1.00 unary 22
% 3.56/1.00 binary 40
% 3.56/1.00 lits 624
% 3.56/1.00 lits eq 80
% 3.56/1.00 fd_pure 0
% 3.56/1.00 fd_pseudo 0
% 3.56/1.00 fd_cond 21
% 3.56/1.00 fd_pseudo_cond 14
% 3.56/1.00 AC symbols 0
% 3.56/1.00
% 3.56/1.00 ------ Input Options Time Limit: Unbounded
% 3.56/1.00
% 3.56/1.00
% 3.56/1.00 ------
% 3.56/1.00 Current options:
% 3.56/1.00 ------
% 3.56/1.00
% 3.56/1.00
% 3.56/1.00
% 3.56/1.00
% 3.56/1.00 ------ Proving...
% 3.56/1.00
% 3.56/1.00
% 3.56/1.00 % SZS status Theorem for theBenchmark.p
% 3.56/1.00
% 3.56/1.00 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.56/1.00
% 4.04/1.01
%------------------------------------------------------------------------------