TSTP Solution File: SWC258+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC258+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n018.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:46 EDT 2024
% Result : Theorem 4.24s 1.19s
% Output : CNFRefutation 4.24s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
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] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ( ? [X5] :
( leq(X5,X4)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| totalorderedP(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)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ( ? [X5] :
( leq(X5,X4)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| totalorderedP(X0)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f180,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f65]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ totalorderedP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ totalorderedP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ totalorderedP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ totalorderedP(sK53)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ totalorderedP(sK53)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ totalorderedP(sK53)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ totalorderedP(sK53)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil = sK55
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = sK55
& ssItem(X4) ) )
& ~ totalorderedP(sK53)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( ( nil = sK55
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = sK55
& ssItem(X4) ) )
& ~ totalorderedP(sK53)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( nil = sK55
& nil = sK56 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(sK56,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(sK56,X4)
& cons(X4,nil) = sK55
& ssItem(X4) ) )
& ~ totalorderedP(sK53)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(sK56,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(sK56,X4)
& cons(X4,nil) = sK55
& ssItem(X4) )
=> ( ! [X5] :
( ~ leq(X5,sK57)
| ~ memberP(sK56,X5)
| sK57 = X5
| ~ ssItem(X5) )
& memberP(sK56,sK57)
& sK55 = cons(sK57,nil)
& ssItem(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ( ( nil = sK55
& nil = sK56 )
| ( ! [X5] :
( ~ leq(X5,sK57)
| ~ memberP(sK56,X5)
| sK57 = X5
| ~ ssItem(X5) )
& memberP(sK56,sK57)
& sK55 = cons(sK57,nil)
& ssItem(sK57) ) )
& ~ 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])],[f222,f347,f346,f345,f344,f343]) ).
fof(f503,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f180]) ).
fof(f504,plain,
totalorderedP(nil),
inference(cnf_transformation,[],[f66]) ).
fof(f553,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f348]) ).
fof(f554,plain,
~ totalorderedP(sK53),
inference(cnf_transformation,[],[f348]) ).
fof(f559,plain,
( nil = sK55
| ssItem(sK57) ),
inference(cnf_transformation,[],[f348]) ).
fof(f560,plain,
( nil = sK55
| sK55 = cons(sK57,nil) ),
inference(cnf_transformation,[],[f348]) ).
fof(f563,plain,
~ totalorderedP(sK55),
inference(definition_unfolding,[],[f554,f553]) ).
cnf(c_203,plain,
( ~ ssItem(X0)
| totalorderedP(cons(X0,nil)) ),
inference(cnf_transformation,[],[f503]) ).
cnf(c_204,plain,
totalorderedP(nil),
inference(cnf_transformation,[],[f504]) ).
cnf(c_248,negated_conjecture,
( cons(sK57,nil) = sK55
| nil = sK55 ),
inference(cnf_transformation,[],[f560]) ).
cnf(c_249,negated_conjecture,
( nil = sK55
| ssItem(sK57) ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_254,negated_conjecture,
~ totalorderedP(sK55),
inference(cnf_transformation,[],[f563]) ).
cnf(c_8954,plain,
cons(sK57,nil) = sP0_iProver_def,
definition ).
cnf(c_8957,negated_conjecture,
~ totalorderedP(sK55),
inference(demodulation,[status(thm)],[c_254]) ).
cnf(c_8962,negated_conjecture,
( nil = sK55
| ssItem(sK57) ),
inference(demodulation,[status(thm)],[c_249]) ).
cnf(c_8963,negated_conjecture,
( nil = sK55
| sP0_iProver_def = sK55 ),
inference(demodulation,[status(thm)],[c_248]) ).
cnf(c_11875,plain,
( ~ totalorderedP(nil)
| sK55 = sP0_iProver_def ),
inference(superposition,[status(thm)],[c_8963,c_8957]) ).
cnf(c_11877,plain,
sK55 = sP0_iProver_def,
inference(forward_subsumption_resolution,[status(thm)],[c_11875,c_204]) ).
cnf(c_11881,plain,
( nil = sP0_iProver_def
| ssItem(sK57) ),
inference(demodulation,[status(thm)],[c_8962,c_11877]) ).
cnf(c_11882,plain,
~ totalorderedP(sP0_iProver_def),
inference(demodulation,[status(thm)],[c_8957,c_11877]) ).
cnf(c_12057,plain,
( ~ ssItem(sK57)
| totalorderedP(sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_8954,c_203]) ).
cnf(c_12058,plain,
~ ssItem(sK57),
inference(forward_subsumption_resolution,[status(thm)],[c_12057,c_11882]) ).
cnf(c_12059,plain,
nil = sP0_iProver_def,
inference(backward_subsumption_resolution,[status(thm)],[c_11881,c_12058]) ).
cnf(c_12078,plain,
totalorderedP(sP0_iProver_def),
inference(demodulation,[status(thm)],[c_204,c_12059]) ).
cnf(c_12084,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_12078,c_11882]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC258+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n018.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:43:46 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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
% 4.24/1.19 % SZS status Started for theBenchmark.p
% 4.24/1.19 % SZS status Theorem for theBenchmark.p
% 4.24/1.19
% 4.24/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.24/1.19
% 4.24/1.19 ------ iProver source info
% 4.24/1.19
% 4.24/1.19 git: date: 2024-05-02 19:28:25 +0000
% 4.24/1.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.24/1.19 git: non_committed_changes: false
% 4.24/1.19
% 4.24/1.19 ------ Parsing...
% 4.24/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.24/1.19
% 4.24/1.19 ------ 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: 4 0s sf_e pe_s pe_e
% 4.24/1.19
% 4.24/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.24/1.19
% 4.24/1.19 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.24/1.19 ------ Proving...
% 4.24/1.19 ------ Problem Properties
% 4.24/1.19
% 4.24/1.19
% 4.24/1.19 clauses 192
% 4.24/1.19 conjectures 11
% 4.24/1.19 EPR 60
% 4.24/1.19 Horn 116
% 4.24/1.19 unary 20
% 4.24/1.19 binary 46
% 4.24/1.19 lits 644
% 4.24/1.19 lits eq 91
% 4.24/1.19 fd_pure 0
% 4.24/1.19 fd_pseudo 0
% 4.24/1.19 fd_cond 23
% 4.24/1.19 fd_pseudo_cond 14
% 4.24/1.19 AC symbols 0
% 4.24/1.19
% 4.24/1.19 ------ Schedule dynamic 5 is on
% 4.24/1.19
% 4.24/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.24/1.19
% 4.24/1.19
% 4.24/1.19 ------
% 4.24/1.19 Current options:
% 4.24/1.19 ------
% 4.24/1.19
% 4.24/1.19
% 4.24/1.19
% 4.24/1.19
% 4.24/1.19 ------ Proving...
% 4.24/1.19
% 4.24/1.19
% 4.24/1.19 % SZS status Theorem for theBenchmark.p
% 4.24/1.19
% 4.24/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.24/1.19
% 4.24/1.19
%------------------------------------------------------------------------------