TSTP Solution File: SWC367+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC367+1 : TPTP v8.1.2. Released v2.4.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 : Thu Aug 31 20:42:53 EDT 2023
% Result : Theorem 1.69s 1.15s
% Output : CNFRefutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 13 unt; 0 def)
% Number of atoms : 170 ( 65 equ)
% Maximal formula atoms : 22 ( 5 avg)
% Number of connectives : 174 ( 36 ~; 33 |; 90 &)
% ( 2 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 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 : 36 ( 0 sgn; 12 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f52,axiom,
! [X0] :
( ssList(X0)
=> ( rearsegP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax52) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| rearsegP(X1,X0)
| 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) )
& ( nil != X2
| nil != X3 ) )
| rearsegP(X1,X0)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f167,plain,
! [X0] :
( ( rearsegP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f52]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ~ rearsegP(X1,X0)
& 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) )
| ( nil = X2
& nil = X3 ) )
& ~ rearsegP(X1,X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f329,plain,
! [X0] :
( ( ( rearsegP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ rearsegP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f167]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ~ rearsegP(X1,X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ~ rearsegP(X1,sK53)
& 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) )
| ( nil = X2
& nil = X3 ) )
& ~ rearsegP(X1,sK53)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ~ rearsegP(sK54,sK53)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ~ rearsegP(sK54,sK53)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( rearsegP(X3,sK55)
& neq(sK55,nil) )
| ( nil = sK55
& nil = X3 ) )
& ~ rearsegP(sK54,sK53)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( ( rearsegP(X3,sK55)
& neq(sK55,nil) )
| ( nil = sK55
& nil = X3 ) )
& ~ rearsegP(sK54,sK53)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( rearsegP(sK56,sK55)
& neq(sK55,nil) )
| ( nil = sK55
& nil = sK56 ) )
& ~ rearsegP(sK54,sK53)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ( ( rearsegP(sK56,sK55)
& neq(sK55,nil) )
| ( nil = sK55
& nil = sK56 ) )
& ~ rearsegP(sK54,sK53)
& 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(f440,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f488,plain,
! [X0] :
( rearsegP(nil,X0)
| nil != X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f329]) ).
fof(f551,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f347]) ).
fof(f552,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f347]) ).
fof(f553,plain,
~ rearsegP(sK54,sK53),
inference(cnf_transformation,[],[f347]) ).
fof(f556,plain,
( rearsegP(sK56,sK55)
| nil = sK56 ),
inference(cnf_transformation,[],[f347]) ).
fof(f557,plain,
( rearsegP(sK56,sK55)
| nil = sK55 ),
inference(cnf_transformation,[],[f347]) ).
fof(f558,plain,
~ rearsegP(sK56,sK55),
inference(definition_unfolding,[],[f553,f551,f552]) ).
fof(f579,plain,
( rearsegP(nil,nil)
| ~ ssList(nil) ),
inference(equality_resolution,[],[f488]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f440]) ).
cnf(c_188,plain,
( ~ ssList(nil)
| rearsegP(nil,nil) ),
inference(cnf_transformation,[],[f579]) ).
cnf(c_246,negated_conjecture,
( nil = sK55
| rearsegP(sK56,sK55) ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_247,negated_conjecture,
( nil = sK56
| rearsegP(sK56,sK55) ),
inference(cnf_transformation,[],[f556]) ).
cnf(c_250,negated_conjecture,
~ rearsegP(sK56,sK55),
inference(cnf_transformation,[],[f558]) ).
cnf(c_363,plain,
rearsegP(nil,nil),
inference(global_subsumption_just,[status(thm)],[c_188,c_141,c_188]) ).
cnf(c_371,negated_conjecture,
nil = sK56,
inference(global_subsumption_just,[status(thm)],[c_247,c_250,c_247]) ).
cnf(c_373,negated_conjecture,
nil = sK55,
inference(global_subsumption_just,[status(thm)],[c_246,c_250,c_246]) ).
cnf(c_1701,plain,
~ rearsegP(nil,nil),
inference(light_normalisation,[status(thm)],[c_250,c_371,c_373]) ).
cnf(c_1702,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1701,c_363]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC367+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Aug 28 17:37:37 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.69/1.15 % SZS status Started for theBenchmark.p
% 1.69/1.15 % SZS status Theorem for theBenchmark.p
% 1.69/1.15
% 1.69/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.69/1.15
% 1.69/1.15 ------ iProver source info
% 1.69/1.15
% 1.69/1.15 git: date: 2023-05-31 18:12:56 +0000
% 1.69/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.69/1.15 git: non_committed_changes: false
% 1.69/1.15 git: last_make_outside_of_git: false
% 1.69/1.15
% 1.69/1.15 ------ Parsing...
% 1.69/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.69/1.15
% 1.69/1.15 ------ Preprocessing...
% 1.69/1.15
% 1.69/1.15 % SZS status Theorem for theBenchmark.p
% 1.69/1.15
% 1.69/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.69/1.15
% 1.69/1.15
%------------------------------------------------------------------------------