TSTP Solution File: SWC276+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC276+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n004.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 3.73s 1.12s
% Output : CNFRefutation 3.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 30 ( 10 unt; 0 def)
% Number of atoms : 181 ( 77 equ)
% Maximal formula atoms : 24 ( 6 avg)
% Number of connectives : 184 ( 33 ~; 31 |; 104 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn; 13 !; 35 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f65,axiom,
! [X0] :
( ssItem(X0)
=> totalorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax65) ).
fof(f66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox2/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)
=> ( ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| totalorderedP(X0)
| 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)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ( ~ 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] :
( 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] :
( 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] :
( 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] :
( 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] :
( 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] :
( 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] :
( 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] :
( 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] :
( memberP(X3,X4)
& cons(X4,nil) = sK55
& ssItem(X4) ) )
& ~ totalorderedP(sK53)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( nil = sK55
& nil = sK56 )
| ? [X4] :
( memberP(sK56,X4)
& cons(X4,nil) = sK55
& ssItem(X4) ) )
& ~ totalorderedP(sK53)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X4] :
( memberP(sK56,X4)
& cons(X4,nil) = sK55
& ssItem(X4) )
=> ( memberP(sK56,sK57)
& sK55 = cons(sK57,nil)
& ssItem(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ( ( nil = sK55
& nil = sK56 )
| ( 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(f558,plain,
( nil = sK55
| ssItem(sK57) ),
inference(cnf_transformation,[],[f348]) ).
fof(f559,plain,
( nil = sK55
| sK55 = cons(sK57,nil) ),
inference(cnf_transformation,[],[f348]) ).
fof(f561,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_247,negated_conjecture,
( cons(sK57,nil) = sK55
| nil = sK55 ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_248,negated_conjecture,
( nil = sK55
| ssItem(sK57) ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_252,negated_conjecture,
~ totalorderedP(sK55),
inference(cnf_transformation,[],[f561]) ).
cnf(c_12037,plain,
( ~ ssItem(sK57)
| nil = sK55
| totalorderedP(sK55) ),
inference(superposition,[status(thm)],[c_247,c_203]) ).
cnf(c_12038,plain,
( ~ ssItem(sK57)
| nil = sK55 ),
inference(forward_subsumption_resolution,[status(thm)],[c_12037,c_252]) ).
cnf(c_12066,plain,
nil = sK55,
inference(global_subsumption_just,[status(thm)],[c_12038,c_248,c_12038]) ).
cnf(c_12077,plain,
~ totalorderedP(nil),
inference(demodulation,[status(thm)],[c_252,c_12066]) ).
cnf(c_12079,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_12077,c_204]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC276+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.13 % Command : run_iprover %s %d THM
% 0.13/0.32 % Computer : n004.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Mon Aug 28 15:20:07 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.19/0.45 Running first-order theorem proving
% 0.19/0.45 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.73/1.12 % SZS status Started for theBenchmark.p
% 3.73/1.12 % SZS status Theorem for theBenchmark.p
% 3.73/1.12
% 3.73/1.12 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.73/1.12
% 3.73/1.12 ------ iProver source info
% 3.73/1.12
% 3.73/1.12 git: date: 2023-05-31 18:12:56 +0000
% 3.73/1.12 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.73/1.12 git: non_committed_changes: false
% 3.73/1.12 git: last_make_outside_of_git: false
% 3.73/1.12
% 3.73/1.12 ------ Parsing...
% 3.73/1.12 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.73/1.12
% 3.73/1.12 ------ 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
% 3.73/1.12
% 3.73/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.73/1.12
% 3.73/1.12 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.73/1.12 ------ Proving...
% 3.73/1.12 ------ Problem Properties
% 3.73/1.12
% 3.73/1.12
% 3.73/1.12 clauses 189
% 3.73/1.12 conjectures 9
% 3.73/1.12 EPR 56
% 3.73/1.12 Horn 115
% 3.73/1.12 unary 19
% 3.73/1.12 binary 46
% 3.73/1.12 lits 633
% 3.73/1.12 lits eq 86
% 3.73/1.12 fd_pure 0
% 3.73/1.12 fd_pseudo 0
% 3.73/1.12 fd_cond 21
% 3.73/1.12 fd_pseudo_cond 14
% 3.73/1.12 AC symbols 0
% 3.73/1.12
% 3.73/1.12 ------ Schedule dynamic 5 is on
% 3.73/1.12
% 3.73/1.12 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.73/1.12
% 3.73/1.12
% 3.73/1.12 ------
% 3.73/1.12 Current options:
% 3.73/1.12 ------
% 3.73/1.12
% 3.73/1.12
% 3.73/1.12
% 3.73/1.12
% 3.73/1.12 ------ Proving...
% 3.73/1.12
% 3.73/1.12
% 3.73/1.12 % SZS status Theorem for theBenchmark.p
% 3.73/1.12
% 3.73/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.73/1.12
% 3.73/1.12
%------------------------------------------------------------------------------