TSTP Solution File: SWC275+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC275+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n001.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:12 EDT 2023
% Result : Theorem 0.78s 1.17s
% Output : CNFRefutation 0.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 50 ( 18 unt; 0 def)
% Number of atoms : 239 ( 93 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 273 ( 84 ~; 76 |; 97 &)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn; 21 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f65,axiom,
! [X0] :
( ssItem(X0)
=> totalorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax65) ).
fof(f66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax66) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( neq(X3,nil)
& ! [X4] :
( ~ memberP(X3,X4)
| cons(X4,nil) != X2
| ~ ssItem(X4) ) )
| ( nil = X3
& nil != X2 )
| totalorderedP(X0)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( neq(X3,nil)
& ! [X4] :
( ~ memberP(X3,X4)
| cons(X4,nil) != X2
| ~ ssItem(X4) ) )
| ( nil = X3
& nil != X2 )
| totalorderedP(X0)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f180,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f65]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ totalorderedP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f315,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f342,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ totalorderedP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ totalorderedP(sK53)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f343,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ totalorderedP(sK53)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ totalorderedP(sK53)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ totalorderedP(sK53)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK55
& ssItem(X4) ) )
& ( nil != X3
| nil = sK55 )
& ~ totalorderedP(sK53)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK55
& ssItem(X4) ) )
& ( nil != X3
| nil = sK55 )
& ~ totalorderedP(sK53)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ~ neq(sK56,nil)
| ? [X4] :
( memberP(sK56,X4)
& cons(X4,nil) = sK55
& ssItem(X4) ) )
& ( nil != sK56
| nil = sK55 )
& ~ totalorderedP(sK53)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X4] :
( memberP(sK56,X4)
& cons(X4,nil) = sK55
& ssItem(X4) )
=> ( memberP(sK56,sK57)
& sK55 = cons(sK57,nil)
& ssItem(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ( ~ neq(sK56,nil)
| ( memberP(sK56,sK57)
& sK55 = cons(sK57,nil)
& ssItem(sK57) ) )
& ( nil != sK56
| nil = sK55 )
& ~ totalorderedP(sK53)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57])],[f221,f346,f345,f344,f343,f342]) ).
fof(f438,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f315]) ).
fof(f440,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f502,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f180]) ).
fof(f503,plain,
totalorderedP(nil),
inference(cnf_transformation,[],[f66]) ).
fof(f548,plain,
ssList(sK54),
inference(cnf_transformation,[],[f347]) ).
fof(f551,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f347]) ).
fof(f552,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f347]) ).
fof(f553,plain,
~ totalorderedP(sK53),
inference(cnf_transformation,[],[f347]) ).
fof(f554,plain,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f347]) ).
fof(f555,plain,
( ~ neq(sK56,nil)
| ssItem(sK57) ),
inference(cnf_transformation,[],[f347]) ).
fof(f556,plain,
( ~ neq(sK56,nil)
| sK55 = cons(sK57,nil) ),
inference(cnf_transformation,[],[f347]) ).
fof(f558,plain,
~ totalorderedP(sK55),
inference(definition_unfolding,[],[f553,f552]) ).
fof(f559,plain,
ssList(sK56),
inference(definition_unfolding,[],[f548,f551]) ).
cnf(c_138,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f438]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f440]) ).
cnf(c_203,plain,
( ~ ssItem(X0)
| totalorderedP(cons(X0,nil)) ),
inference(cnf_transformation,[],[f502]) ).
cnf(c_204,plain,
totalorderedP(nil),
inference(cnf_transformation,[],[f503]) ).
cnf(c_247,negated_conjecture,
( ~ neq(sK56,nil)
| cons(sK57,nil) = sK55 ),
inference(cnf_transformation,[],[f556]) ).
cnf(c_248,negated_conjecture,
( ~ neq(sK56,nil)
| ssItem(sK57) ),
inference(cnf_transformation,[],[f555]) ).
cnf(c_249,negated_conjecture,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f554]) ).
cnf(c_250,negated_conjecture,
~ totalorderedP(sK55),
inference(cnf_transformation,[],[f558]) ).
cnf(c_253,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f559]) ).
cnf(c_3228,plain,
( X0 != sK56
| X1 != nil
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| ssItem(sK57) ),
inference(resolution_lifted,[status(thm)],[c_138,c_248]) ).
cnf(c_3229,plain,
( ~ ssList(nil)
| ~ ssList(sK56)
| sK56 = nil
| ssItem(sK57) ),
inference(unflattening,[status(thm)],[c_3228]) ).
cnf(c_3230,plain,
( sK56 = nil
| ssItem(sK57) ),
inference(global_subsumption_just,[status(thm)],[c_3229,c_253,c_141,c_3229]) ).
cnf(c_3238,plain,
( X0 != sK56
| X1 != nil
| ~ ssList(X0)
| ~ ssList(X1)
| cons(sK57,nil) = sK55
| X0 = X1 ),
inference(resolution_lifted,[status(thm)],[c_138,c_247]) ).
cnf(c_3239,plain,
( ~ ssList(nil)
| ~ ssList(sK56)
| cons(sK57,nil) = sK55
| sK56 = nil ),
inference(unflattening,[status(thm)],[c_3238]) ).
cnf(c_3240,plain,
( cons(sK57,nil) = sK55
| sK56 = nil ),
inference(global_subsumption_just,[status(thm)],[c_3239,c_253,c_141,c_3239]) ).
cnf(c_11958,plain,
( ~ ssItem(sK57)
| nil = sK56
| totalorderedP(sK55) ),
inference(superposition,[status(thm)],[c_3240,c_203]) ).
cnf(c_11959,plain,
( ~ ssItem(sK57)
| nil = sK56 ),
inference(forward_subsumption_resolution,[status(thm)],[c_11958,c_250]) ).
cnf(c_11966,plain,
nil = sK56,
inference(superposition,[status(thm)],[c_3230,c_11959]) ).
cnf(c_11967,plain,
nil = sK55,
inference(backward_subsumption_resolution,[status(thm)],[c_249,c_11966]) ).
cnf(c_11972,plain,
~ totalorderedP(nil),
inference(demodulation,[status(thm)],[c_250,c_11967]) ).
cnf(c_11974,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11972,c_204]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC275+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n001.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 15:56:05 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
% 0.78/1.17 % SZS status Started for theBenchmark.p
% 0.78/1.17 % SZS status Theorem for theBenchmark.p
% 0.78/1.17
% 0.78/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.78/1.17
% 0.78/1.17 ------ iProver source info
% 0.78/1.17
% 0.78/1.17 git: date: 2023-05-31 18:12:56 +0000
% 0.78/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.78/1.17 git: non_committed_changes: false
% 0.78/1.17 git: last_make_outside_of_git: false
% 0.78/1.17
% 0.78/1.17 ------ Parsing...
% 0.78/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.78/1.17
% 0.78/1.17 ------ 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
% 0.78/1.17
% 0.78/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.78/1.17
% 0.78/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.78/1.17 ------ Proving...
% 0.78/1.17 ------ Problem Properties
% 0.78/1.17
% 0.78/1.17
% 0.78/1.17 clauses 187
% 0.78/1.17 conjectures 4
% 0.78/1.17 EPR 55
% 0.78/1.17 Horn 116
% 0.78/1.17 unary 19
% 0.78/1.17 binary 44
% 0.78/1.17 lits 629
% 0.78/1.17 lits eq 84
% 0.78/1.17 fd_pure 0
% 0.78/1.17 fd_pseudo 0
% 0.78/1.17 fd_cond 21
% 0.78/1.17 fd_pseudo_cond 14
% 0.78/1.17 AC symbols 0
% 0.78/1.17
% 0.78/1.17 ------ Schedule dynamic 5 is on
% 0.78/1.17
% 0.78/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.78/1.17
% 0.78/1.17
% 0.78/1.17 ------
% 0.78/1.17 Current options:
% 0.78/1.17 ------
% 0.78/1.17
% 0.78/1.17
% 0.78/1.17
% 0.78/1.17
% 0.78/1.17 ------ Proving...
% 0.78/1.17
% 0.78/1.17
% 0.78/1.17 % SZS status Theorem for theBenchmark.p
% 0.78/1.17
% 0.78/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.78/1.18
% 0.78/1.18
%------------------------------------------------------------------------------