TSTP Solution File: SWC121+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC121+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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:41:08 EDT 2023
% Result : Theorem 1.11s 1.17s
% Output : CNFRefutation 1.11s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f603)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ( segmentP(X1,X0)
& neq(X0,nil) )
| ~ segmentP(X3,X2)
| ~ neq(X2,nil)
| ~ 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)
& neq(X0,nil) )
| ~ segmentP(X3,X2)
| ~ neq(X2,nil)
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& segmentP(X3,X2)
& neq(X2,nil)
& 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)
| ~ neq(X0,nil) )
& segmentP(X3,X2)
& neq(X2,nil)
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& segmentP(X3,X2)
& neq(X2,nil)
& 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)
| ~ neq(sK53,nil) )
& segmentP(X3,X2)
& neq(X2,nil)
& 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)
| ~ neq(sK53,nil) )
& segmentP(X3,X2)
& neq(X2,nil)
& neq(X1,nil) ) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK54,nil) )
| ( ( ~ segmentP(sK54,sK53)
| ~ neq(sK53,nil) )
& segmentP(X3,X2)
& neq(X2,nil)
& 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)
| ~ neq(sK53,nil) )
& segmentP(X3,X2)
& neq(X2,nil)
& neq(sK54,nil) ) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK54,nil) )
| ( ( ~ segmentP(sK54,sK53)
| ~ neq(sK53,nil) )
& segmentP(X3,sK55)
& neq(sK55,nil)
& 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)
| ~ neq(sK53,nil) )
& segmentP(X3,sK55)
& neq(sK55,nil)
& neq(sK54,nil) ) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK56,nil)
& neq(sK54,nil) )
| ( ( ~ segmentP(sK54,sK53)
| ~ neq(sK53,nil) )
& segmentP(sK56,sK55)
& neq(sK55,nil)
& neq(sK54,nil) ) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ( ( ~ neq(sK56,nil)
& neq(sK54,nil) )
| ( ( ~ segmentP(sK54,sK53)
| ~ neq(sK53,nil) )
& segmentP(sK56,sK55)
& neq(sK55,nil)
& 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])],[f222,f346,f345,f344,f343]) ).
fof(f551,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f347]) ).
fof(f552,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f347]) ).
fof(f558,plain,
( ~ neq(sK56,nil)
| neq(sK55,nil) ),
inference(cnf_transformation,[],[f347]) ).
fof(f559,plain,
( ~ neq(sK56,nil)
| segmentP(sK56,sK55) ),
inference(cnf_transformation,[],[f347]) ).
fof(f560,plain,
( ~ neq(sK56,nil)
| ~ segmentP(sK54,sK53)
| ~ neq(sK53,nil) ),
inference(cnf_transformation,[],[f347]) ).
fof(f561,plain,
( ~ neq(sK56,nil)
| ~ segmentP(sK56,sK55)
| ~ neq(sK55,nil) ),
inference(definition_unfolding,[],[f560,f551,f552,f552]) ).
cnf(c_246,negated_conjecture,
( ~ neq(sK56,nil)
| ~ neq(sK55,nil)
| ~ segmentP(sK56,sK55) ),
inference(cnf_transformation,[],[f561]) ).
cnf(c_247,negated_conjecture,
( ~ neq(sK56,nil)
| segmentP(sK56,sK55) ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_248,negated_conjecture,
( ~ neq(sK56,nil)
| neq(sK55,nil) ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_252,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f603]) ).
cnf(c_310,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_246,c_247,c_248,c_252]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC121+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n026.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 : Mon Aug 28 16:27:50 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.11/1.17 % SZS status Started for theBenchmark.p
% 1.11/1.17 % SZS status Theorem for theBenchmark.p
% 1.11/1.17
% 1.11/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.11/1.17
% 1.11/1.17 ------ iProver source info
% 1.11/1.17
% 1.11/1.17 git: date: 2023-05-31 18:12:56 +0000
% 1.11/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.11/1.17 git: non_committed_changes: false
% 1.11/1.17 git: last_make_outside_of_git: false
% 1.11/1.17
% 1.11/1.17 ------ Parsing...
% 1.11/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.11/1.17
% 1.11/1.17 ------ Preprocessing...
% 1.11/1.17
% 1.11/1.17 % SZS status Theorem for theBenchmark.p
% 1.11/1.17
% 1.11/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.11/1.17
% 1.11/1.17
%------------------------------------------------------------------------------