TSTP Solution File: SWC203+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC203+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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:11:34 EDT 2024
% Result : Theorem 1.13s 1.18s
% Output : CNFRefutation 1.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 11 unt; 0 def)
% Number of atoms : 116 ( 43 equ)
% Maximal formula atoms : 18 ( 5 avg)
% Number of connectives : 119 ( 23 ~; 8 |; 76 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 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)
=> ( neq(X0,nil)
| ~ neq(X1,nil)
| X2 != X3
| 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(X0,nil)
| ~ neq(X1,nil)
| X2 != X3
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(X0,nil)
& neq(X1,nil)
& X2 = X3
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(X0,nil)
& neq(X1,nil)
& X2 = X3
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(X0,nil)
& neq(X1,nil)
& X2 = X3
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(sK53,nil)
& neq(X1,nil)
& X2 = X3
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(sK53,nil)
& neq(X1,nil)
& X2 = X3
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ~ neq(sK53,nil)
& neq(sK54,nil)
& X2 = X3
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ~ neq(sK53,nil)
& neq(sK54,nil)
& X2 = X3
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ~ neq(sK53,nil)
& neq(sK54,nil)
& sK55 = X3
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ~ neq(sK53,nil)
& neq(sK54,nil)
& sK55 = X3
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ~ neq(sK53,nil)
& neq(sK54,nil)
& sK55 = sK56
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ~ neq(sK53,nil)
& neq(sK54,nil)
& sK55 = sK56
& 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,
sK55 = sK56,
inference(cnf_transformation,[],[f347]) ).
fof(f554,plain,
neq(sK54,nil),
inference(cnf_transformation,[],[f347]) ).
fof(f555,plain,
~ neq(sK53,nil),
inference(cnf_transformation,[],[f347]) ).
fof(f556,plain,
sK53 = sK56,
inference(definition_unfolding,[],[f552,f553]) ).
fof(f557,plain,
~ neq(sK56,nil),
inference(definition_unfolding,[],[f555,f556]) ).
fof(f558,plain,
neq(sK56,nil),
inference(definition_unfolding,[],[f554,f551]) ).
cnf(c_246,negated_conjecture,
~ neq(sK56,nil),
inference(cnf_transformation,[],[f557]) ).
cnf(c_247,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f558]) ).
cnf(c_252,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_246,c_247]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC203+1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n013.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 : Thu May 2 23:28:04 EDT 2024
% 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 --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.13/1.18 % SZS status Started for theBenchmark.p
% 1.13/1.18 % SZS status Theorem for theBenchmark.p
% 1.13/1.18
% 1.13/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.13/1.18
% 1.13/1.18 ------ iProver source info
% 1.13/1.18
% 1.13/1.18 git: date: 2024-05-02 19:28:25 +0000
% 1.13/1.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.13/1.18 git: non_committed_changes: false
% 1.13/1.18
% 1.13/1.18 ------ Parsing...
% 1.13/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.13/1.18
% 1.13/1.18 ------ Preprocessing...
% 1.13/1.18
% 1.13/1.18 % SZS status Theorem for theBenchmark.p
% 1.13/1.18
% 1.13/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.13/1.18
% 1.13/1.18
%------------------------------------------------------------------------------