TSTP Solution File: SWC014-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC014-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.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:10:52 EDT 2024
% Result : Unsatisfiable 23.72s 4.16s
% Output : CNFRefutation 23.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 25
% Syntax : Number of clauses : 76 ( 20 unt; 8 nHn; 61 RR)
% Number of literals : 204 ( 61 equ; 133 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 87 ( 25 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(c_50,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(c_52,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).
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_62,negated_conjecture,
( app(sk1,X0) != X1
| tl(sk2) != X0
| X1 != sk2
| ~ neq(sk4,nil)
| ~ neq(nil,sk2)
| ~ ssList(X0)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(c_63,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(c_64,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
cnf(c_65,negated_conjecture,
( ~ neq(sk4,nil)
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
cnf(c_66,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk5,nil),sk6) = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).
cnf(c_74,plain,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(c_127,plain,
( ~ ssList(X0)
| frontsegP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause61) ).
cnf(c_138,plain,
( ~ ssList(X0)
| ssItem(X1)
| duplicatefreeP(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(c_143,plain,
( ~ ssList(X0)
| X0 = nil
| ssList(tl(X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause77) ).
cnf(c_150,plain,
( ~ frontsegP(nil,X0)
| ~ ssList(X0)
| X0 = nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause84) ).
cnf(c_151,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(c_152,plain,
( ~ ssList(X0)
| ~ ssItem(X1)
| ssList(cons(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(c_162,plain,
( ~ ssList(X0)
| ~ ssItem(X1)
| tl(cons(X1,X0)) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(c_166,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(c_181,negated_conjecture,
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(c_186,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_245,negated_conjecture,
( 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/sandbox/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(c_256,negated_conjecture,
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(unflattening,[status(thm)],[c_181]) ).
cnf(c_268,negated_conjecture,
( ~ 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_270,negated_conjecture,
( app(sk1,tl(sk2)) != sk2
| ~ ssList(app(sk1,tl(sk2)))
| ~ ssList(tl(sk2))
| ~ neq(sk4,nil)
| ~ neq(nil,sk2) ),
inference(unflattening,[status(thm)],[c_62]) ).
cnf(c_320,plain,
( ~ ssList(nil)
| frontsegP(nil,nil) ),
inference(instantiation,[status(thm)],[c_127]) ).
cnf(c_338,plain,
( ~ frontsegP(nil,nil)
| ~ ssList(nil)
| nil = nil ),
inference(instantiation,[status(thm)],[c_150]) ).
cnf(c_350,plain,
( ~ neq(nil,nil)
| ~ ssList(nil) ),
inference(instantiation,[status(thm)],[c_256]) ).
cnf(c_550,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_552,plain,
( X0 != X1
| X2 != X3
| ~ neq(X1,X3)
| neq(X0,X2) ),
theory(equality) ).
cnf(c_779,plain,
( ~ neq(sk2,nil)
| ssItem(sk5) ),
inference(superposition,[status(thm)],[c_53,c_63]) ).
cnf(c_780,plain,
( ~ neq(sk2,nil)
| ssList(sk6) ),
inference(superposition,[status(thm)],[c_53,c_64]) ).
cnf(c_798,plain,
( ~ neq(sk2,nil)
| cons(sk5,nil) = sk3 ),
inference(superposition,[status(thm)],[c_53,c_65]) ).
cnf(c_799,plain,
( ~ neq(sk2,nil)
| app(cons(sk5,nil),sk6) = sk4 ),
inference(superposition,[status(thm)],[c_53,c_66]) ).
cnf(c_1662,plain,
( X0 != sk2
| X1 != nil
| ~ neq(sk2,nil)
| neq(X0,X1) ),
inference(instantiation,[status(thm)],[c_552]) ).
cnf(c_1663,plain,
( nil != sk2
| nil != nil
| ~ neq(sk2,nil)
| neq(nil,nil) ),
inference(instantiation,[status(thm)],[c_1662]) ).
cnf(c_2807,plain,
( X0 != X1
| sk2 != X1
| X0 = sk2 ),
inference(instantiation,[status(thm)],[c_550]) ).
cnf(c_2808,plain,
( sk2 != nil
| nil != nil
| nil = sk2 ),
inference(instantiation,[status(thm)],[c_2807]) ).
cnf(c_3773,negated_conjecture,
ssItem(sk5),
inference(global_subsumption_just,[status(thm)],[c_63,c_55,c_779]) ).
cnf(c_4375,plain,
( ~ ssList(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1)
| ssItem(X4) ),
inference(resolution,[status(thm)],[c_268,c_138]) ).
cnf(c_4467,plain,
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssList(cons(X1,X3))
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1)
| ssItem(X4) ),
inference(resolution,[status(thm)],[c_4375,c_151]) ).
cnf(c_4481,plain,
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1)
| ssItem(X4) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4467,c_152]) ).
cnf(c_4500,plain,
( ~ ssList(cons(X0,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X0)
| ssItem(X4) ),
inference(resolution,[status(thm)],[c_4481,c_151]) ).
cnf(c_4507,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3)
| ssItem(X4) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4500,c_152]) ).
cnf(c_4529,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ssItem(X3) ),
inference(resolution,[status(thm)],[c_4507,c_3773]) ).
cnf(c_6228,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssItem(X2) ),
inference(resolution,[status(thm)],[c_4529,c_49]) ).
cnf(c_6296,plain,
( ~ ssList(X0)
| ssItem(X1) ),
inference(resolution,[status(thm)],[c_6228,c_49]) ).
cnf(c_6339,plain,
( ~ ssList(X0)
| tl(cons(X1,X0)) = X0 ),
inference(backward_subsumption_resolution,[status(thm)],[c_162,c_6296]) ).
cnf(c_6349,plain,
( ~ ssList(X0)
| app(cons(X1,nil),X0) = cons(X1,X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_186,c_6296]) ).
cnf(c_8758,plain,
( ~ ssList(X0)
| ~ ssList(sk2)
| sk2 = X0
| neq(X0,sk2) ),
inference(instantiation,[status(thm)],[c_166]) ).
cnf(c_8759,plain,
( ~ ssList(sk2)
| ~ ssList(nil)
| sk2 = nil
| neq(nil,sk2) ),
inference(instantiation,[status(thm)],[c_8758]) ).
cnf(c_8767,plain,
( X0 != sk4
| sk2 != sk4
| X0 = sk2 ),
inference(instantiation,[status(thm)],[c_2807]) ).
cnf(c_8768,plain,
( sk2 != sk4
| nil != sk4
| nil = sk2 ),
inference(instantiation,[status(thm)],[c_8767]) ).
cnf(c_8777,plain,
( ~ ssList(sk2)
| sk2 = nil
| ssList(tl(sk2)) ),
inference(instantiation,[status(thm)],[c_143]) ).
cnf(c_14330,plain,
( ~ ssList(X0)
| ~ ssList(sk4)
| X0 = sk4
| neq(sk4,X0) ),
inference(instantiation,[status(thm)],[c_166]) ).
cnf(c_14331,plain,
( ~ ssList(sk4)
| ~ ssList(nil)
| nil = sk4
| neq(sk4,nil) ),
inference(instantiation,[status(thm)],[c_14330]) ).
cnf(c_14432,negated_conjecture,
ssList(sk6),
inference(global_subsumption_just,[status(thm)],[c_64,c_55,c_780]) ).
cnf(c_14438,negated_conjecture,
cons(sk5,nil) = sk3,
inference(global_subsumption_just,[status(thm)],[c_65,c_55,c_798]) ).
cnf(c_14440,negated_conjecture,
app(cons(sk5,nil),sk6) = sk4,
inference(global_subsumption_just,[status(thm)],[c_66,c_55,c_799]) ).
cnf(c_14442,plain,
app(sk3,sk6) = sk4,
inference(superposition,[status(thm)],[c_14438,c_14440]) ).
cnf(c_14453,plain,
( ~ ssList(app(sk1,tl(sk2)))
| app(sk1,tl(sk2)) != sk2 ),
inference(global_subsumption_just,[status(thm)],[c_270,c_52,c_50,c_74,c_55,c_53,c_320,c_338,c_350,c_270,c_1663,c_2808,c_8759,c_8768,c_8777,c_14331]) ).
cnf(c_14454,negated_conjecture,
( app(sk1,tl(sk2)) != sk2
| ~ ssList(app(sk1,tl(sk2))) ),
inference(renaming,[status(thm)],[c_14453]) ).
cnf(c_14463,plain,
app(sk1,sk6) = sk4,
inference(superposition,[status(thm)],[c_54,c_14442]) ).
cnf(c_14936,plain,
( ~ ssList(X0)
| tl(cons(X1,X0)) = X0 ),
inference(global_subsumption_just,[status(thm)],[c_162,c_6339]) ).
cnf(c_14942,plain,
tl(cons(X0,sk6)) = sk6,
inference(superposition,[status(thm)],[c_14432,c_14936]) ).
cnf(c_15242,plain,
( ~ ssList(X0)
| app(cons(X1,nil),X0) = cons(X1,X0) ),
inference(global_subsumption_just,[status(thm)],[c_186,c_6349]) ).
cnf(c_15248,plain,
app(cons(X0,nil),sk6) = cons(X0,sk6),
inference(superposition,[status(thm)],[c_14432,c_15242]) ).
cnf(c_15642,plain,
cons(sk5,sk6) = sk4,
inference(superposition,[status(thm)],[c_15248,c_14440]) ).
cnf(c_15685,plain,
tl(sk4) = sk6,
inference(superposition,[status(thm)],[c_15642,c_14942]) ).
cnf(c_15755,plain,
tl(sk2) = sk6,
inference(superposition,[status(thm)],[c_53,c_15685]) ).
cnf(c_15765,plain,
( app(sk1,sk6) != sk2
| ~ ssList(app(sk1,tl(sk2))) ),
inference(superposition,[status(thm)],[c_15755,c_14454]) ).
cnf(c_16315,plain,
( sk2 != sk4
| ~ ssList(app(sk1,tl(sk2))) ),
inference(superposition,[status(thm)],[c_14463,c_15765]) ).
cnf(c_28773,negated_conjecture,
~ ssList(app(sk1,tl(sk2))),
inference(global_subsumption_just,[status(thm)],[c_270,c_53,c_16315]) ).
cnf(c_29114,plain,
( ~ ssList(tl(sk2))
| ~ ssList(sk1) ),
inference(superposition,[status(thm)],[c_151,c_28773]) ).
cnf(c_29150,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_29114,c_8777,c_2808,c_1663,c_350,c_338,c_320,c_55,c_74,c_49,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SWC014-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n010.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu May 2 23:18:49 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 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
% 23.72/4.16 % SZS status Started for theBenchmark.p
% 23.72/4.16 % SZS status Unsatisfiable for theBenchmark.p
% 23.72/4.16
% 23.72/4.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 23.72/4.16
% 23.72/4.16 ------ iProver source info
% 23.72/4.16
% 23.72/4.16 git: date: 2024-05-02 19:28:25 +0000
% 23.72/4.16 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 23.72/4.16 git: non_committed_changes: false
% 23.72/4.16
% 23.72/4.16 ------ Parsing...successful
% 23.72/4.16
% 23.72/4.16
% 23.72/4.16
% 23.72/4.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e sup_sim: 0 sf_s rm: 1 0s sf_e
% 23.72/4.16
% 23.72/4.16 ------ Preprocessing...
% 23.72/4.16
% 23.72/4.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 23.72/4.16 ------ Proving...
% 23.72/4.16 ------ Problem Properties
% 23.72/4.16
% 23.72/4.16
% 23.72/4.16 clauses 191
% 23.72/4.16 conjectures 24
% 23.72/4.16 EPR 63
% 23.72/4.16 Horn 161
% 23.72/4.16 unary 65
% 23.72/4.16 binary 25
% 23.72/4.16 lits 571
% 23.72/4.16 lits eq 76
% 23.72/4.16 fd_pure 0
% 23.72/4.16 fd_pseudo 0
% 23.72/4.16 fd_cond 15
% 23.72/4.16 fd_pseudo_cond 16
% 23.72/4.16 AC symbols 0
% 23.72/4.16
% 23.72/4.16 ------ Input Options Time Limit: Unbounded
% 23.72/4.16
% 23.72/4.16
% 23.72/4.16 ------
% 23.72/4.16 Current options:
% 23.72/4.16 ------
% 23.72/4.16
% 23.72/4.16
% 23.72/4.16
% 23.72/4.16
% 23.72/4.16 ------ Proving...
% 23.72/4.16
% 23.72/4.16
% 23.72/4.16 % SZS status Unsatisfiable for theBenchmark.p
% 23.72/4.16
% 23.72/4.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 23.72/4.16
% 23.72/4.17
%------------------------------------------------------------------------------