TSTP Solution File: SWC365+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC365+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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:10 EDT 2024
% Result : Theorem 0.46s 1.14s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 9 unt; 0 def)
% Number of atoms : 170 ( 54 equ)
% Maximal formula atoms : 26 ( 8 avg)
% Number of connectives : 201 ( 51 ~; 36 |; 102 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 32 ( 0 sgn 8 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| ( nil = X3
& nil != X2 )
| rearsegP(X1,X0)
| ~ neq(X1,nil)
| 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)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| ( nil = X3
& nil != X2 )
| rearsegP(X1,X0)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ~ rearsegP(X1,X0)
& 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] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ~ rearsegP(X1,X0)
& 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] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ~ rearsegP(X1,X0)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ~ rearsegP(X1,sK53)
& neq(X1,nil)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ~ rearsegP(X1,sK53)
& neq(X1,nil)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ~ rearsegP(sK54,sK53)
& neq(sK54,nil)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ~ rearsegP(sK54,sK53)
& neq(sK54,nil)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( rearsegP(X3,sK55)
& neq(sK55,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = sK55 )
& ~ rearsegP(sK54,sK53)
& neq(sK54,nil)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( ( rearsegP(X3,sK55)
& neq(sK55,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = sK55 )
& ~ rearsegP(sK54,sK53)
& neq(sK54,nil)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( rearsegP(sK56,sK55)
& neq(sK55,nil) )
| ~ neq(sK56,nil) )
& ( nil != sK56
| nil = sK55 )
& ~ rearsegP(sK54,sK53)
& neq(sK54,nil)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ( ( rearsegP(sK56,sK55)
& neq(sK55,nil) )
| ~ neq(sK56,nil) )
& ( nil != sK56
| nil = sK55 )
& ~ rearsegP(sK54,sK53)
& 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(f553,plain,
neq(sK54,nil),
inference(cnf_transformation,[],[f347]) ).
fof(f554,plain,
~ rearsegP(sK54,sK53),
inference(cnf_transformation,[],[f347]) ).
fof(f557,plain,
( rearsegP(sK56,sK55)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f347]) ).
fof(f558,plain,
~ rearsegP(sK56,sK55),
inference(definition_unfolding,[],[f554,f551,f552]) ).
fof(f559,plain,
neq(sK56,nil),
inference(definition_unfolding,[],[f553,f551]) ).
cnf(c_246,negated_conjecture,
( ~ neq(sK56,nil)
| rearsegP(sK56,sK55) ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_249,negated_conjecture,
~ rearsegP(sK56,sK55),
inference(cnf_transformation,[],[f558]) ).
cnf(c_250,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f559]) ).
cnf(c_275,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_246,c_249,c_250]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SWC365+1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n009.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.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu May 2 23:28:55 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 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
% 0.46/1.14 % SZS status Started for theBenchmark.p
% 0.46/1.14 % SZS status Theorem for theBenchmark.p
% 0.46/1.14
% 0.46/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.46/1.14
% 0.46/1.14 ------ iProver source info
% 0.46/1.14
% 0.46/1.14 git: date: 2024-05-02 19:28:25 +0000
% 0.46/1.14 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.46/1.14 git: non_committed_changes: false
% 0.46/1.14
% 0.46/1.14 ------ Parsing...
% 0.46/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.46/1.14
% 0.46/1.14 ------ Preprocessing...
% 0.46/1.14
% 0.46/1.14 % SZS status Theorem for theBenchmark.p
% 0.46/1.14
% 0.46/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.46/1.14
% 0.46/1.14
%------------------------------------------------------------------------------