TSTP Solution File: SWC311-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC311-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 : Thu Aug 31 20:42:26 EDT 2023
% Result : Unsatisfiable 13.91s 2.66s
% Output : CNFRefutation 13.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 19
% Syntax : Number of clauses : 53 ( 7 unt; 10 nHn; 53 RR)
% Number of literals : 182 ( 83 equ; 129 neg)
% Maximal clause size : 11 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_50,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
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,
( sk4 != nil
| sk3 = nil ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(c_56,negated_conjecture,
( app(X0,X1) != X2
| cons(X3,nil) != X1
| tl(sk4) != X0
| hd(sk4) != X3
| ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3)
| X2 = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(c_57,negated_conjecture,
( sk2 = nil
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(c_58,negated_conjecture,
( app(cons(X0,nil),X1) != sk2
| app(X1,cons(X0,nil)) != sk1
| ~ ssList(X1)
| ~ ssItem(X0)
| sk2 = nil ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(c_59,negated_conjecture,
( sk1 != nil
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(c_60,negated_conjecture,
( app(cons(X0,nil),X1) != sk2
| app(X1,cons(X0,nil)) != sk1
| sk1 != nil
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(c_68,plain,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(c_137,plain,
( ~ ssList(X0)
| X0 = nil
| ssList(tl(X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause77) ).
cnf(c_138,plain,
( ~ ssList(X0)
| X0 = nil
| ssItem(hd(X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause78) ).
cnf(c_145,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(c_146,plain,
( ~ ssList(X0)
| ~ ssItem(X1)
| ssList(cons(X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(c_160,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(c_164,plain,
( ~ ssList(X0)
| cons(hd(X0),tl(X0)) = X0
| X0 = nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(c_175,plain,
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(c_180,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_251,plain,
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(unflattening,[status(thm)],[c_175]) ).
cnf(c_269,negated_conjecture,
( ~ ssList(app(tl(sk4),cons(hd(sk4),nil)))
| ~ ssList(cons(hd(sk4),nil))
| ~ ssList(tl(sk4))
| ~ ssItem(hd(sk4))
| ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| app(tl(sk4),cons(hd(sk4),nil)) = sk3 ),
inference(unflattening,[status(thm)],[c_56]) ).
cnf(c_643,plain,
( ~ ssList(cons(hd(sk4),nil))
| ~ ssList(tl(sk4))
| ~ ssItem(hd(sk4))
| ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| app(tl(sk4),cons(hd(sk4),nil)) = sk3 ),
inference(backward_subsumption_resolution,[status(thm)],[c_269,c_145]) ).
cnf(c_1554,plain,
( sk2 != nil
| sk1 = nil ),
inference(light_normalisation,[status(thm)],[c_55,c_53,c_54]) ).
cnf(c_1555,plain,
( ~ ssList(cons(hd(sk2),nil))
| ~ ssList(tl(sk2))
| ~ ssItem(hd(sk2))
| ~ neq(sk2,nil)
| ~ neq(nil,sk2)
| app(tl(sk2),cons(hd(sk2),nil)) = sk1 ),
inference(light_normalisation,[status(thm)],[c_643,c_53,c_54]) ).
cnf(c_2430,plain,
( ~ ssItem(hd(sk2))
| ~ ssList(tl(sk2))
| ~ ssList(cons(hd(sk2),nil))
| ~ neq(nil,sk2)
| app(tl(sk2),cons(hd(sk2),nil)) = sk1 ),
inference(global_subsumption_just,[status(thm)],[c_1555,c_57,c_59,c_1554,c_1555]) ).
cnf(c_2431,plain,
( ~ ssList(cons(hd(sk2),nil))
| ~ ssList(tl(sk2))
| ~ ssItem(hd(sk2))
| ~ neq(nil,sk2)
| app(tl(sk2),cons(hd(sk2),nil)) = sk1 ),
inference(renaming,[status(thm)],[c_2430]) ).
cnf(c_2432,plain,
( app(X1,cons(X0,nil)) != sk1
| app(cons(X0,nil),X1) != sk2
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(global_subsumption_just,[status(thm)],[c_60,c_58,c_60,c_1554]) ).
cnf(c_2433,negated_conjecture,
( app(cons(X0,nil),X1) != sk2
| app(X1,cons(X0,nil)) != sk1
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(renaming,[status(thm)],[c_2432]) ).
cnf(c_2437,plain,
( ~ ssItem(X0)
| ~ ssList(X1)
| app(X1,cons(X0,nil)) != sk1
| app(cons(X0,nil),X1) != sk2 ),
inference(global_subsumption_just,[status(thm)],[c_58,c_2433]) ).
cnf(c_2438,negated_conjecture,
( app(cons(X0,nil),X1) != sk2
| app(X1,cons(X0,nil)) != sk1
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(renaming,[status(thm)],[c_2437]) ).
cnf(c_2439,negated_conjecture,
neq(sk2,nil),
inference(global_subsumption_just,[status(thm)],[c_57,c_57,c_59,c_1554]) ).
cnf(c_3852,plain,
( X0 != sk2
| X0 != nil
| ~ ssList(X0) ),
inference(resolution_lifted,[status(thm)],[c_2439,c_251]) ).
cnf(c_3853,plain,
( sk2 != nil
| ~ ssList(sk2) ),
inference(unflattening,[status(thm)],[c_3852]) ).
cnf(c_3892,plain,
( X0 != sk2
| X1 != nil
| ~ ssList(cons(hd(sk2),nil))
| ~ ssList(tl(sk2))
| ~ ssItem(hd(sk2))
| ~ ssList(X0)
| ~ ssList(X1)
| app(tl(sk2),cons(hd(sk2),nil)) = sk1
| X0 = X1 ),
inference(resolution_lifted,[status(thm)],[c_160,c_2431]) ).
cnf(c_3893,plain,
( ~ ssList(cons(hd(sk2),nil))
| ~ ssList(tl(sk2))
| ~ ssItem(hd(sk2))
| ~ ssList(sk2)
| ~ ssList(nil)
| app(tl(sk2),cons(hd(sk2),nil)) = sk1
| sk2 = nil ),
inference(unflattening,[status(thm)],[c_3892]) ).
cnf(c_3894,plain,
( app(tl(sk2),cons(hd(sk2),nil)) = sk1
| ~ ssItem(hd(sk2))
| ~ ssList(tl(sk2))
| ~ ssList(cons(hd(sk2),nil)) ),
inference(global_subsumption_just,[status(thm)],[c_3893,c_50,c_68,c_3853,c_3893]) ).
cnf(c_3895,plain,
( ~ ssList(cons(hd(sk2),nil))
| ~ ssList(tl(sk2))
| ~ ssItem(hd(sk2))
| app(tl(sk2),cons(hd(sk2),nil)) = sk1 ),
inference(renaming,[status(thm)],[c_3894]) ).
cnf(c_6450,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_9000,plain,
( ~ ssList(sk2)
| cons(hd(sk2),tl(sk2)) = sk2
| sk2 = nil ),
inference(instantiation,[status(thm)],[c_164]) ).
cnf(c_9005,plain,
( ~ ssList(sk2)
| sk2 = nil
| ssList(tl(sk2)) ),
inference(instantiation,[status(thm)],[c_137]) ).
cnf(c_9006,plain,
( ~ ssList(sk2)
| sk2 = nil
| ssItem(hd(sk2)) ),
inference(instantiation,[status(thm)],[c_138]) ).
cnf(c_9035,plain,
( ~ ssItem(hd(sk2))
| ~ ssList(nil)
| ssList(cons(hd(sk2),nil)) ),
inference(instantiation,[status(thm)],[c_146]) ).
cnf(c_9184,plain,
( X0 != X1
| sk2 != X1
| sk2 = X0 ),
inference(instantiation,[status(thm)],[c_6450]) ).
cnf(c_10772,plain,
( X0 != sk4
| sk2 != sk4
| sk2 = X0 ),
inference(instantiation,[status(thm)],[c_9184]) ).
cnf(c_10789,plain,
( X0 != sk2
| sk2 != sk2
| sk2 = X0 ),
inference(instantiation,[status(thm)],[c_9184]) ).
cnf(c_12719,plain,
app(tl(sk2),cons(hd(sk2),nil)) = sk1,
inference(global_subsumption_just,[status(thm)],[c_3895,c_50,c_68,c_3853,c_3895,c_9006,c_9005,c_9035]) ).
cnf(c_12851,plain,
( app(cons(hd(sk2),nil),tl(sk2)) != sk2
| ~ ssList(tl(sk2))
| ~ ssItem(hd(sk2)) ),
inference(resolution,[status(thm)],[c_2438,c_12719]) ).
cnf(c_16638,plain,
( sk2 != sk4
| sk2 = sk2 ),
inference(instantiation,[status(thm)],[c_10772]) ).
cnf(c_20702,plain,
( cons(hd(sk2),tl(sk2)) != sk2
| sk2 != sk2
| sk2 = cons(hd(sk2),tl(sk2)) ),
inference(instantiation,[status(thm)],[c_10789]) ).
cnf(c_20735,plain,
( X0 != X1
| sk2 != X1
| X0 = sk2 ),
inference(instantiation,[status(thm)],[c_6450]) ).
cnf(c_23358,plain,
( X0 != cons(hd(sk2),tl(sk2))
| sk2 != cons(hd(sk2),tl(sk2))
| X0 = sk2 ),
inference(instantiation,[status(thm)],[c_20735]) ).
cnf(c_33650,plain,
( ~ ssList(tl(sk2))
| ~ ssItem(hd(sk2))
| app(cons(hd(sk2),nil),tl(sk2)) = cons(hd(sk2),tl(sk2)) ),
inference(instantiation,[status(thm)],[c_180]) ).
cnf(c_33829,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_23358]) ).
cnf(c_33830,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_33829,c_33650,c_20702,c_16638,c_12851,c_9000,c_9005,c_9006,c_3853,c_53,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC311-1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 28 18:21:32 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 13.91/2.66 % SZS status Started for theBenchmark.p
% 13.91/2.66 % SZS status Unsatisfiable for theBenchmark.p
% 13.91/2.66
% 13.91/2.66 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 13.91/2.66
% 13.91/2.66 ------ iProver source info
% 13.91/2.66
% 13.91/2.66 git: date: 2023-05-31 18:12:56 +0000
% 13.91/2.66 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 13.91/2.66 git: non_committed_changes: false
% 13.91/2.66 git: last_make_outside_of_git: false
% 13.91/2.66
% 13.91/2.66 ------ Parsing...successful
% 13.91/2.66
% 13.91/2.66
% 13.91/2.66
% 13.91/2.66 ------ Preprocessing... sup_sim: 2 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 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
% 13.91/2.66
% 13.91/2.66 ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 13.91/2.66
% 13.91/2.66 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 13.91/2.66 ------ Proving...
% 13.91/2.66 ------ Problem Properties
% 13.91/2.66
% 13.91/2.66
% 13.91/2.66 clauses 186
% 13.91/2.66 conjectures 7
% 13.91/2.66 EPR 59
% 13.91/2.66 Horn 158
% 13.91/2.66 unary 65
% 13.91/2.66 binary 21
% 13.91/2.66 lits 556
% 13.91/2.66 lits eq 75
% 13.91/2.66 fd_pure 0
% 13.91/2.66 fd_pseudo 0
% 13.91/2.66 fd_cond 15
% 13.91/2.66 fd_pseudo_cond 14
% 13.91/2.66 AC symbols 0
% 13.91/2.66
% 13.91/2.66 ------ Input Options Time Limit: Unbounded
% 13.91/2.66
% 13.91/2.66
% 13.91/2.66 ------
% 13.91/2.66 Current options:
% 13.91/2.66 ------
% 13.91/2.66
% 13.91/2.66
% 13.91/2.66
% 13.91/2.66
% 13.91/2.66 ------ Proving...
% 13.91/2.66
% 13.91/2.66
% 13.91/2.66 % SZS status Unsatisfiable for theBenchmark.p
% 13.91/2.66
% 13.91/2.66 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 13.91/2.66
% 13.91/2.67
%------------------------------------------------------------------------------