TSTP Solution File: SWC316-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC316-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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:29 EDT 2023
% Result : Unsatisfiable 135.01s 18.81s
% Output : CNFRefutation 135.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 25
% Syntax : Number of clauses : 82 ( 18 unt; 13 nHn; 70 RR)
% Number of literals : 240 ( 61 equ; 161 neg)
% Maximal clause size : 12 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 3 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 75 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(c_53,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(c_54,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(c_55,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(c_62,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(c_63,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(c_64,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk5,nil),sk6) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(c_65,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk6,cons(sk5,nil)) = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(c_66,negated_conjecture,
( app(X0,X1) != X2
| cons(X3,nil) != X1
| tl(sk1) != X0
| hd(sk1) != X3
| X2 != sk2
| ~ neq(sk1,nil)
| ~ neq(sk4,nil)
| ~ neq(nil,sk1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(c_74,plain,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(c_138,plain,
( ~ ssList(X0)
| ssItem(X1)
| duplicatefreeP(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(c_143,plain,
( ~ ssList(X0)
| X0 = nil
| ssList(tl(X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause77) ).
cnf(c_144,plain,
( ~ ssList(X0)
| X0 = nil
| ssItem(hd(X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause78) ).
cnf(c_151,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(c_152,plain,
( ~ ssList(X0)
| ~ ssItem(X1)
| ssList(cons(X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(c_162,plain,
( ~ ssList(X0)
| ~ ssItem(X1)
| tl(cons(X1,X0)) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(c_163,plain,
( ~ ssList(X0)
| ~ ssItem(X1)
| hd(cons(X1,X0)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(c_165,plain,
( cons(X0,X1) != X1
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(c_166,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(c_168,plain,
( ~ ssItem(X0)
| ~ ssItem(X1)
| X0 = X1
| neq(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause102) ).
cnf(c_184,plain,
( app(X0,X1) != nil
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(c_186,plain,
( ~ ssList(X0)
| ~ ssItem(X1)
| app(cons(X1,nil),X0) = cons(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(c_245,plain,
( app(app(X0,cons(X1,X2)),cons(X1,X3)) != X4
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssItem(X1)
| ~ duplicatefreeP(X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(c_268,plain,
( ~ ssList(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ~ duplicatefreeP(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1) ),
inference(unflattening,[status(thm)],[c_245]) ).
cnf(c_276,negated_conjecture,
( app(tl(sk1),cons(hd(sk1),nil)) != sk2
| ~ ssList(app(tl(sk1),cons(hd(sk1),nil)))
| ~ ssList(cons(hd(sk1),nil))
| ~ ssList(tl(sk1))
| ~ neq(sk1,nil)
| ~ neq(sk4,nil)
| ~ neq(nil,sk1)
| ~ ssItem(hd(sk1)) ),
inference(unflattening,[status(thm)],[c_66]) ).
cnf(c_666,plain,
( app(tl(sk1),cons(hd(sk1),nil)) != sk2
| ~ ssList(cons(hd(sk1),nil))
| ~ ssList(tl(sk1))
| ~ neq(sk1,nil)
| ~ neq(sk4,nil)
| ~ neq(nil,sk1)
| ~ ssItem(hd(sk1)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_276,c_151]) ).
cnf(c_1559,plain,
( ~ neq(sk2,nil)
| ssList(sk6) ),
inference(light_normalisation,[status(thm)],[c_63,c_53]) ).
cnf(c_1560,plain,
( ~ neq(sk2,nil)
| ssItem(sk5) ),
inference(light_normalisation,[status(thm)],[c_62,c_53]) ).
cnf(c_1561,plain,
( ~ neq(sk2,nil)
| app(sk6,cons(sk5,nil)) = sk2 ),
inference(light_normalisation,[status(thm)],[c_65,c_53]) ).
cnf(c_1562,plain,
( ~ neq(sk2,nil)
| app(cons(sk5,nil),sk6) = sk1 ),
inference(light_normalisation,[status(thm)],[c_64,c_53,c_54]) ).
cnf(c_1563,plain,
( app(tl(sk1),cons(hd(sk1),nil)) != sk2
| ~ ssList(cons(hd(sk1),nil))
| ~ ssList(tl(sk1))
| ~ neq(sk1,nil)
| ~ neq(sk2,nil)
| ~ neq(nil,sk1)
| ~ ssItem(hd(sk1)) ),
inference(light_normalisation,[status(thm)],[c_666,c_53]) ).
cnf(c_2438,plain,
( ~ neq(sk1,nil)
| ~ ssList(tl(sk1))
| ~ ssList(cons(hd(sk1),nil))
| app(tl(sk1),cons(hd(sk1),nil)) != sk2
| ~ neq(nil,sk1)
| ~ ssItem(hd(sk1)) ),
inference(global_subsumption_just,[status(thm)],[c_1563,c_55,c_1563]) ).
cnf(c_2439,plain,
( app(tl(sk1),cons(hd(sk1),nil)) != sk2
| ~ ssList(cons(hd(sk1),nil))
| ~ ssList(tl(sk1))
| ~ neq(sk1,nil)
| ~ neq(nil,sk1)
| ~ ssItem(hd(sk1)) ),
inference(renaming,[status(thm)],[c_2438]) ).
cnf(c_2440,plain,
app(cons(sk5,nil),sk6) = sk1,
inference(global_subsumption_just,[status(thm)],[c_1562,c_55,c_1562]) ).
cnf(c_2446,plain,
ssList(sk6),
inference(global_subsumption_just,[status(thm)],[c_1559,c_55,c_1559]) ).
cnf(c_4433,plain,
( ssItem(X0)
| ~ sP0_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_138]) ).
cnf(c_4434,plain,
( duplicatefreeP(X0)
| ~ ssList(X0)
| ~ sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split])],[c_138]) ).
cnf(c_4435,plain,
( sP0_iProver_split
| sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_138]) ).
cnf(c_4438,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_4441,plain,
( X0 != X1
| ~ ssItem(X1)
| ssItem(X0) ),
theory(equality) ).
cnf(c_4466,plain,
( ~ sP0_iProver_split
| ssItem(nil) ),
inference(instantiation,[status(thm)],[c_4433]) ).
cnf(c_7108,plain,
( cons(sk5,X0) != X0
| ~ ssList(X0)
| ~ ssItem(sk5) ),
inference(instantiation,[status(thm)],[c_165]) ).
cnf(c_7112,plain,
( cons(sk5,nil) != nil
| ~ ssList(nil)
| ~ ssItem(sk5) ),
inference(instantiation,[status(thm)],[c_7108]) ).
cnf(c_7116,plain,
( ~ ssList(app(app(X0,cons(sk5,X1)),cons(sk5,X2)))
| ~ duplicatefreeP(app(app(X0,cons(sk5,X1)),cons(sk5,X2)))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(sk5) ),
inference(instantiation,[status(thm)],[c_268]) ).
cnf(c_7119,plain,
( ~ ssList(app(app(nil,cons(sk5,nil)),cons(sk5,nil)))
| ~ duplicatefreeP(app(app(nil,cons(sk5,nil)),cons(sk5,nil)))
| ~ ssList(nil)
| ~ ssItem(sk5) ),
inference(instantiation,[status(thm)],[c_7116]) ).
cnf(c_7802,plain,
( ~ ssList(app(X0,cons(sk5,X1)))
| ~ ssList(cons(sk5,X2))
| ssList(app(app(X0,cons(sk5,X1)),cons(sk5,X2))) ),
inference(instantiation,[status(thm)],[c_151]) ).
cnf(c_7803,plain,
( ~ ssList(app(nil,cons(sk5,nil)))
| ~ ssList(cons(sk5,nil))
| ssList(app(app(nil,cons(sk5,nil)),cons(sk5,nil))) ),
inference(instantiation,[status(thm)],[c_7802]) ).
cnf(c_8030,plain,
( ~ sP0_iProver_split
| ssItem(sk1) ),
inference(instantiation,[status(thm)],[c_4433]) ).
cnf(c_8103,plain,
( ~ ssList(X0)
| ~ ssItem(sk5)
| ssList(cons(sk5,X0)) ),
inference(instantiation,[status(thm)],[c_152]) ).
cnf(c_8104,plain,
( ~ ssList(nil)
| ~ ssItem(sk5)
| ssList(cons(sk5,nil)) ),
inference(instantiation,[status(thm)],[c_8103]) ).
cnf(c_8581,plain,
( ~ ssList(X0)
| ~ ssList(sk1)
| sk1 = X0
| neq(X0,sk1) ),
inference(instantiation,[status(thm)],[c_166]) ).
cnf(c_8584,plain,
( ~ ssList(sk1)
| ~ ssList(nil)
| sk1 = nil
| neq(nil,sk1) ),
inference(instantiation,[status(thm)],[c_8581]) ).
cnf(c_10287,plain,
( ~ ssList(cons(sk5,X0))
| ~ ssList(X1)
| ssList(app(X1,cons(sk5,X0))) ),
inference(instantiation,[status(thm)],[c_151]) ).
cnf(c_10288,plain,
( ~ ssList(cons(sk5,nil))
| ~ ssList(nil)
| ssList(app(nil,cons(sk5,nil))) ),
inference(instantiation,[status(thm)],[c_10287]) ).
cnf(c_12055,plain,
( ~ ssList(X0)
| ~ ssItem(nil)
| ssList(tl(X0))
| ssItem(X0) ),
inference(resolution,[status(thm)],[c_4441,c_143]) ).
cnf(c_13421,plain,
( ~ ssList(app(app(X0,cons(sk5,X1)),cons(sk5,X2)))
| ~ sP1_iProver_split
| duplicatefreeP(app(app(X0,cons(sk5,X1)),cons(sk5,X2))) ),
inference(instantiation,[status(thm)],[c_4434]) ).
cnf(c_13422,plain,
( ~ ssList(app(app(nil,cons(sk5,nil)),cons(sk5,nil)))
| ~ sP1_iProver_split
| duplicatefreeP(app(app(nil,cons(sk5,nil)),cons(sk5,nil))) ),
inference(instantiation,[status(thm)],[c_13421]) ).
cnf(c_15587,plain,
( sk1 != nil
| ~ ssList(cons(sk5,nil))
| ~ ssList(sk6)
| cons(sk5,nil) = nil ),
inference(superposition,[status(thm)],[c_2440,c_184]) ).
cnf(c_16308,plain,
ssItem(X0),
inference(global_subsumption_just,[status(thm)],[c_12055,c_74,c_55,c_1560,c_4433,c_4435,c_7119,c_7803,c_8104,c_10288,c_13422]) ).
cnf(c_16344,plain,
( ~ ssList(X0)
| tl(cons(X1,X0)) = X0 ),
inference(backward_subsumption_resolution,[status(thm)],[c_162,c_16308]) ).
cnf(c_16345,plain,
( ~ ssList(X0)
| hd(cons(X1,X0)) = X1 ),
inference(backward_subsumption_resolution,[status(thm)],[c_163,c_16308]) ).
cnf(c_16378,plain,
( ~ ssList(X0)
| app(cons(X1,nil),X0) = cons(X1,X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_186,c_16308]) ).
cnf(c_16679,plain,
( X0 != sk1
| app(cons(sk5,nil),sk6) = X0 ),
inference(resolution,[status(thm)],[c_4438,c_2440]) ).
cnf(c_19053,plain,
( ~ ssList(sk1)
| sk1 = nil
| ssList(tl(sk1)) ),
inference(instantiation,[status(thm)],[c_143]) ).
cnf(c_19054,plain,
( ~ ssList(sk1)
| sk1 = nil
| ssItem(hd(sk1)) ),
inference(instantiation,[status(thm)],[c_144]) ).
cnf(c_20937,plain,
( nil != sk1
| ~ ssList(cons(sk5,nil))
| ~ ssList(sk6)
| cons(sk5,nil) = nil ),
inference(resolution,[status(thm)],[c_16679,c_184]) ).
cnf(c_39801,plain,
( ~ ssItem(hd(sk1))
| ~ ssList(nil)
| ssList(cons(hd(sk1),nil)) ),
inference(instantiation,[status(thm)],[c_152]) ).
cnf(c_48808,plain,
( ~ ssItem(X0)
| ~ ssItem(sk1)
| X0 = sk1
| neq(sk1,X0) ),
inference(instantiation,[status(thm)],[c_168]) ).
cnf(c_48809,plain,
( ~ ssItem(sk1)
| ~ ssItem(nil)
| nil = sk1
| neq(sk1,nil) ),
inference(instantiation,[status(thm)],[c_48808]) ).
cnf(c_123917,plain,
app(tl(sk1),cons(hd(sk1),nil)) != sk2,
inference(global_subsumption_just,[status(thm)],[c_2439,c_49,c_74,c_55,c_1559,c_1560,c_2439,c_4466,c_4435,c_7112,c_7119,c_7803,c_8030,c_8104,c_8584,c_10288,c_13422,c_15587,c_19054,c_19053,c_20937,c_39801,c_48809]) ).
cnf(c_124592,plain,
( ~ ssList(X0)
| tl(cons(X1,X0)) = X0 ),
inference(global_subsumption_just,[status(thm)],[c_162,c_16344]) ).
cnf(c_124598,plain,
tl(cons(X0,sk6)) = sk6,
inference(superposition,[status(thm)],[c_2446,c_124592]) ).
cnf(c_124630,plain,
( ~ ssList(X0)
| hd(cons(X1,X0)) = X1 ),
inference(global_subsumption_just,[status(thm)],[c_163,c_16345]) ).
cnf(c_124636,plain,
hd(cons(X0,sk6)) = X0,
inference(superposition,[status(thm)],[c_2446,c_124630]) ).
cnf(c_125058,plain,
( ~ ssList(X0)
| app(cons(X1,nil),X0) = cons(X1,X0) ),
inference(global_subsumption_just,[status(thm)],[c_186,c_16378]) ).
cnf(c_125064,plain,
app(cons(X0,nil),sk6) = cons(X0,sk6),
inference(superposition,[status(thm)],[c_2446,c_125058]) ).
cnf(c_132041,plain,
cons(sk5,sk6) = sk1,
inference(superposition,[status(thm)],[c_2440,c_125064]) ).
cnf(c_132094,plain,
hd(sk1) = sk5,
inference(superposition,[status(thm)],[c_132041,c_124636]) ).
cnf(c_132095,plain,
tl(sk1) = sk6,
inference(superposition,[status(thm)],[c_132041,c_124598]) ).
cnf(c_132109,plain,
app(tl(sk1),cons(sk5,nil)) != sk2,
inference(superposition,[status(thm)],[c_132094,c_123917]) ).
cnf(c_132270,plain,
app(sk6,cons(sk5,nil)) != sk2,
inference(superposition,[status(thm)],[c_132095,c_132109]) ).
cnf(c_132271,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_132270,c_1561,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC316-1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Aug 28 16:40:40 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 135.01/18.81 % SZS status Started for theBenchmark.p
% 135.01/18.81 % SZS status Unsatisfiable for theBenchmark.p
% 135.01/18.81
% 135.01/18.81 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 135.01/18.81
% 135.01/18.81 ------ iProver source info
% 135.01/18.81
% 135.01/18.81 git: date: 2023-05-31 18:12:56 +0000
% 135.01/18.81 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 135.01/18.81 git: non_committed_changes: false
% 135.01/18.81 git: last_make_outside_of_git: false
% 135.01/18.81
% 135.01/18.81 ------ Parsing...successful
% 135.01/18.81
% 135.01/18.81
% 135.01/18.81
% 135.01/18.81 ------ Preprocessing... sup_sim: 5 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 135.01/18.81
% 135.01/18.81 ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 135.01/18.81
% 135.01/18.81 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 135.01/18.81 ------ Proving...
% 135.01/18.81 ------ Problem Properties
% 135.01/18.81
% 135.01/18.81
% 135.01/18.81 clauses 193
% 135.01/18.81 conjectures 7
% 135.01/18.81 EPR 65
% 135.01/18.81 Horn 163
% 135.01/18.81 unary 69
% 135.01/18.81 binary 23
% 135.01/18.81 lits 570
% 135.01/18.81 lits eq 76
% 135.01/18.81 fd_pure 0
% 135.01/18.81 fd_pseudo 0
% 135.01/18.81 fd_cond 15
% 135.01/18.81 fd_pseudo_cond 16
% 135.01/18.81 AC symbols 0
% 135.01/18.81
% 135.01/18.81 ------ Input Options Time Limit: Unbounded
% 135.01/18.81
% 135.01/18.81
% 135.01/18.81 ------
% 135.01/18.81 Current options:
% 135.01/18.81 ------
% 135.01/18.81
% 135.01/18.81
% 135.01/18.81
% 135.01/18.81
% 135.01/18.81 ------ Proving...
% 135.01/18.81
% 135.01/18.81
% 135.01/18.81 % SZS status Unsatisfiable for theBenchmark.p
% 135.01/18.81
% 135.01/18.81 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 135.01/18.81
% 135.01/18.82
%------------------------------------------------------------------------------