TSTP Solution File: SWC308-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC308-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n005.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:56 EDT 2024
% Result : Unsatisfiable 17.81s 3.12s
% Output : CNFRefutation 17.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 19
% Syntax : Number of clauses : 49 ( 7 unt; 7 nHn; 49 RR)
% Number of literals : 168 ( 66 equ; 122 neg)
% Maximal clause size : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_50,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(c_53,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(c_54,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(c_55,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(c_56,negated_conjecture,
( app(X0,X1) != X2
| cons(X3,nil) != X1
| tl(sk2) != X0
| hd(sk2) != X3
| X2 != sk1
| ~ neq(nil,sk2)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(c_57,negated_conjecture,
( app(cons(X0,nil),X1) != sk4
| ~ ssList(X1)
| ~ ssItem(X0)
| app(X1,cons(X0,nil)) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(c_66,plain,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(c_132,plain,
( ~ ssList(X0)
| app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(c_135,plain,
( ~ ssList(X0)
| X0 = nil
| ssList(tl(X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause77) ).
cnf(c_136,plain,
( ~ ssList(X0)
| X0 = nil
| ssItem(hd(X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause78) ).
cnf(c_143,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(c_144,plain,
( ~ ssList(X0)
| ~ ssItem(X1)
| ssList(cons(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(c_158,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(c_162,plain,
( ~ ssList(X0)
| cons(hd(X0),tl(X0)) = X0
| X0 = nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(c_173,plain,
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(c_178,plain,
( ~ ssList(X0)
| ~ ssItem(X1)
| app(cons(X1,nil),X0) = cons(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(c_186,plain,
( ~ rearsegP(X0,X1)
| ~ rearsegP(X1,X0)
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause128) ).
cnf(c_201,plain,
( app(X0,X1) != X2
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| rearsegP(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause143) ).
cnf(c_249,plain,
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(unflattening,[status(thm)],[c_173]) ).
cnf(c_254,plain,
( ~ ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1)
| rearsegP(app(X0,X1),X1) ),
inference(unflattening,[status(thm)],[c_201]) ).
cnf(c_267,negated_conjecture,
( app(tl(sk2),cons(hd(sk2),nil)) != sk1
| ~ ssList(app(tl(sk2),cons(hd(sk2),nil)))
| ~ ssList(cons(hd(sk2),nil))
| ~ ssList(tl(sk2))
| ~ neq(nil,sk2)
| ~ ssItem(hd(sk2)) ),
inference(unflattening,[status(thm)],[c_56]) ).
cnf(c_634,plain,
( app(tl(sk2),cons(hd(sk2),nil)) != sk1
| ~ ssList(cons(hd(sk2),nil))
| ~ ssList(tl(sk2))
| ~ neq(nil,sk2)
| ~ ssItem(hd(sk2)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_267,c_143]) ).
cnf(c_635,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| rearsegP(app(X0,X1),X1) ),
inference(backward_subsumption_resolution,[status(thm)],[c_254,c_143]) ).
cnf(c_1532,plain,
( app(cons(X0,nil),X1) != sk2
| ~ ssList(X1)
| ~ ssItem(X0)
| app(X1,cons(X0,nil)) = sk3 ),
inference(light_normalisation,[status(thm)],[c_57,c_53]) ).
cnf(c_1533,plain,
( app(tl(sk2),cons(hd(sk2),nil)) != sk3
| ~ ssList(cons(hd(sk2),nil))
| ~ ssList(tl(sk2))
| ~ neq(nil,sk2)
| ~ ssItem(hd(sk2)) ),
inference(light_normalisation,[status(thm)],[c_634,c_54]) ).
cnf(c_1839,plain,
( X0 != sk2
| X0 != nil
| ~ ssList(X0) ),
inference(resolution_lifted,[status(thm)],[c_55,c_249]) ).
cnf(c_1840,plain,
( sk2 != nil
| ~ ssList(sk2) ),
inference(unflattening,[status(thm)],[c_1839]) ).
cnf(c_1870,plain,
( app(tl(sk2),cons(hd(sk2),nil)) != sk3
| X0 != sk2
| X1 != nil
| ~ ssList(cons(hd(sk2),nil))
| ~ ssList(tl(sk2))
| ~ ssItem(hd(sk2))
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1 ),
inference(resolution_lifted,[status(thm)],[c_1533,c_158]) ).
cnf(c_1871,plain,
( app(tl(sk2),cons(hd(sk2),nil)) != sk3
| ~ ssList(cons(hd(sk2),nil))
| ~ ssList(tl(sk2))
| ~ ssItem(hd(sk2))
| ~ ssList(sk2)
| ~ ssList(nil)
| sk2 = nil ),
inference(unflattening,[status(thm)],[c_1870]) ).
cnf(c_1872,plain,
( ~ ssItem(hd(sk2))
| ~ ssList(tl(sk2))
| ~ ssList(cons(hd(sk2),nil))
| app(tl(sk2),cons(hd(sk2),nil)) != sk3 ),
inference(global_subsumption_just,[status(thm)],[c_1871,c_50,c_66,c_1840,c_1871]) ).
cnf(c_1873,plain,
( app(tl(sk2),cons(hd(sk2),nil)) != sk3
| ~ ssList(cons(hd(sk2),nil))
| ~ ssList(tl(sk2))
| ~ ssItem(hd(sk2)) ),
inference(renaming,[status(thm)],[c_1872]) ).
cnf(c_4446,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_6996,plain,
( ~ ssList(sk2)
| cons(hd(sk2),tl(sk2)) = sk2
| sk2 = nil ),
inference(instantiation,[status(thm)],[c_162]) ).
cnf(c_7001,plain,
( ~ ssList(sk2)
| sk2 = nil
| ssList(tl(sk2)) ),
inference(instantiation,[status(thm)],[c_135]) ).
cnf(c_7002,plain,
( ~ ssList(sk2)
| sk2 = nil
| ssItem(hd(sk2)) ),
inference(instantiation,[status(thm)],[c_136]) ).
cnf(c_7027,plain,
( ~ ssItem(hd(sk2))
| ~ ssList(nil)
| ssList(cons(hd(sk2),nil)) ),
inference(instantiation,[status(thm)],[c_144]) ).
cnf(c_7058,plain,
( app(cons(X0,nil),X1) != X2
| sk2 != X2
| app(cons(X0,nil),X1) = sk2 ),
inference(instantiation,[status(thm)],[c_4446]) ).
cnf(c_7214,plain,
( ~ rearsegP(X0,sk2)
| ~ rearsegP(sk2,X0)
| ~ ssList(X0)
| ~ ssList(sk2)
| sk2 = X0 ),
inference(instantiation,[status(thm)],[c_186]) ).
cnf(c_7226,plain,
( X0 != X1
| sk2 != X1
| sk2 = X0 ),
inference(instantiation,[status(thm)],[c_4446]) ).
cnf(c_7248,plain,
( app(cons(X0,nil),X1) != cons(X0,X1)
| sk2 != cons(X0,X1)
| app(cons(X0,nil),X1) = sk2 ),
inference(instantiation,[status(thm)],[c_7058]) ).
cnf(c_8167,plain,
( X0 != sk2
| sk2 != sk2
| sk2 = X0 ),
inference(instantiation,[status(thm)],[c_7226]) ).
cnf(c_9398,plain,
app(nil,sk2) = sk2,
inference(superposition,[status(thm)],[c_50,c_132]) ).
cnf(c_9531,plain,
( ~ rearsegP(sk2,sk2)
| ~ ssList(sk2)
| sk2 = sk2 ),
inference(instantiation,[status(thm)],[c_7214]) ).
cnf(c_9893,plain,
( ~ ssList(sk2)
| ~ ssList(nil)
| rearsegP(sk2,sk2) ),
inference(superposition,[status(thm)],[c_9398,c_635]) ).
cnf(c_20840,plain,
( cons(hd(sk2),tl(sk2)) != sk2
| sk2 != sk2
| sk2 = cons(hd(sk2),tl(sk2)) ),
inference(instantiation,[status(thm)],[c_8167]) ).
cnf(c_24968,plain,
( app(cons(hd(sk2),nil),tl(sk2)) != cons(hd(sk2),tl(sk2))
| sk2 != cons(hd(sk2),tl(sk2))
| app(cons(hd(sk2),nil),tl(sk2)) = sk2 ),
inference(instantiation,[status(thm)],[c_7248]) ).
cnf(c_27999,plain,
( ~ ssList(tl(sk2))
| ~ ssItem(hd(sk2))
| app(cons(hd(sk2),nil),tl(sk2)) = cons(hd(sk2),tl(sk2)) ),
inference(instantiation,[status(thm)],[c_178]) ).
cnf(c_29522,plain,
( app(cons(hd(sk2),nil),tl(sk2)) != sk2
| ~ ssList(tl(sk2))
| ~ ssItem(hd(sk2))
| app(tl(sk2),cons(hd(sk2),nil)) = sk3 ),
inference(instantiation,[status(thm)],[c_1532]) ).
cnf(c_29523,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_29522,c_27999,c_24968,c_20840,c_9893,c_9531,c_7027,c_6996,c_7001,c_7002,c_1873,c_1840,c_66,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWC308-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.11 % Command : run_iprover %s %d THM
% 0.11/0.31 % Computer : n005.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Thu May 2 23:22:41 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.17/0.41 Running first-order theorem proving
% 0.17/0.41 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
% 17.81/3.12 % SZS status Started for theBenchmark.p
% 17.81/3.12 % SZS status Unsatisfiable for theBenchmark.p
% 17.81/3.12
% 17.81/3.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 17.81/3.12
% 17.81/3.12 ------ iProver source info
% 17.81/3.12
% 17.81/3.12 git: date: 2024-05-02 19:28:25 +0000
% 17.81/3.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 17.81/3.12 git: non_committed_changes: false
% 17.81/3.12
% 17.81/3.12 ------ Parsing...successful
% 17.81/3.12
% 17.81/3.12
% 17.81/3.12
% 17.81/3.12 ------ Preprocessing... sup_sim: 3 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 17.81/3.12
% 17.81/3.12 ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 17.81/3.12
% 17.81/3.12 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 17.81/3.12 ------ Proving...
% 17.81/3.12 ------ Problem Properties
% 17.81/3.12
% 17.81/3.12
% 17.81/3.12 clauses 186
% 17.81/3.12 conjectures 6
% 17.81/3.12 EPR 59
% 17.81/3.12 Horn 158
% 17.81/3.12 unary 65
% 17.81/3.12 binary 21
% 17.81/3.12 lits 556
% 17.81/3.12 lits eq 75
% 17.81/3.12 fd_pure 0
% 17.81/3.12 fd_pseudo 0
% 17.81/3.12 fd_cond 15
% 17.81/3.12 fd_pseudo_cond 14
% 17.81/3.12 AC symbols 0
% 17.81/3.12
% 17.81/3.12 ------ Input Options Time Limit: Unbounded
% 17.81/3.12
% 17.81/3.12
% 17.81/3.12 ------
% 17.81/3.12 Current options:
% 17.81/3.12 ------
% 17.81/3.12
% 17.81/3.12
% 17.81/3.12
% 17.81/3.12
% 17.81/3.12 ------ Proving...
% 17.81/3.12
% 17.81/3.12
% 17.81/3.12 % SZS status Unsatisfiable for theBenchmark.p
% 17.81/3.12
% 17.81/3.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 17.81/3.12
% 17.81/3.12
%------------------------------------------------------------------------------