TSTP Solution File: SWC003-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC003-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 : Thu Aug 31 20:40:13 EDT 2023
% Result : Unsatisfiable 3.70s 1.17s
% Output : CNFRefutation 3.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of clauses : 41 ( 14 unt; 1 nHn; 41 RR)
% Number of literals : 120 ( 37 equ; 83 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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_57,negated_conjecture,
( app(app(X0,X1),X2) != sk2
| app(X0,X2) != sk1
| ~ neq(X1,nil)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(c_64,negated_conjecture,
( app(app(X0,X1),X2) != sk2
| app(X0,X2) != sk1
| ~ neq(X1,nil)
| ~ neq(sk4,nil)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(c_65,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(c_66,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(c_67,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_19) ).
cnf(c_68,negated_conjecture,
( ~ neq(sk4,nil)
| app(app(sk6,cons(sk5,nil)),sk7) = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_20) ).
cnf(c_69,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk6,sk7) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_21) ).
cnf(c_78,plain,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(c_141,plain,
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(c_156,plain,
( ~ ssList(X0)
| ~ ssItem(X1)
| ssList(cons(X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(c_170,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(c_208,plain,
( X0 != X1
| ~ ssList(X2)
| ~ ssItem(X0)
| ~ ssItem(X1)
| memberP(cons(X1,X2),X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause138) ).
cnf(c_267,plain,
( ~ ssList(X0)
| ~ ssItem(X1)
| memberP(cons(X1,X0),X1) ),
inference(unflattening,[status(thm)],[c_208]) ).
cnf(c_417,negated_conjecture,
neq(sk2,nil),
inference(global_subsumption_just,[status(thm)],[c_57,c_55]) ).
cnf(c_1611,plain,
( ~ neq(sk2,nil)
| ssList(sk7) ),
inference(light_normalisation,[status(thm)],[c_67,c_53]) ).
cnf(c_1612,plain,
ssList(sk7),
inference(forward_subsumption_resolution,[status(thm)],[c_1611,c_417]) ).
cnf(c_1613,plain,
( ~ neq(sk2,nil)
| ssList(sk6) ),
inference(light_normalisation,[status(thm)],[c_66,c_53]) ).
cnf(c_1614,plain,
ssList(sk6),
inference(forward_subsumption_resolution,[status(thm)],[c_1613,c_417]) ).
cnf(c_1615,plain,
( ~ neq(sk2,nil)
| ssItem(sk5) ),
inference(light_normalisation,[status(thm)],[c_65,c_53]) ).
cnf(c_1616,plain,
ssItem(sk5),
inference(forward_subsumption_resolution,[status(thm)],[c_1615,c_417]) ).
cnf(c_1711,plain,
( ~ neq(sk2,nil)
| app(sk6,sk7) = sk1 ),
inference(light_normalisation,[status(thm)],[c_69,c_53,c_54]) ).
cnf(c_1712,plain,
app(sk6,sk7) = sk1,
inference(forward_subsumption_resolution,[status(thm)],[c_1711,c_417]) ).
cnf(c_1899,plain,
( ~ neq(sk2,nil)
| app(app(sk6,cons(sk5,nil)),sk7) = sk2 ),
inference(light_normalisation,[status(thm)],[c_68,c_53]) ).
cnf(c_1900,plain,
app(app(sk6,cons(sk5,nil)),sk7) = sk2,
inference(forward_subsumption_resolution,[status(thm)],[c_1899,c_417]) ).
cnf(c_2469,plain,
( app(app(X0,X1),X2) != sk2
| app(X0,X2) != sk1
| ~ neq(X1,nil)
| ~ neq(sk2,nil)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(light_normalisation,[status(thm)],[c_64,c_53]) ).
cnf(c_2470,plain,
( app(app(X0,X1),X2) != sk2
| app(X0,X2) != sk1
| ~ neq(X1,nil)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2469,c_417]) ).
cnf(c_2939,plain,
( app(app(X0,X1),X2) != sk2
| app(X0,X2) != sk1
| X1 != X3
| X4 != nil
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| X3 = X4 ),
inference(resolution_lifted,[status(thm)],[c_2470,c_170]) ).
cnf(c_2940,plain,
( app(app(X0,X1),X2) != sk2
| app(X0,X2) != sk1
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(nil)
| X1 = nil ),
inference(unflattening,[status(thm)],[c_2939]) ).
cnf(c_2942,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| app(X0,X2) != sk1
| app(app(X0,X1),X2) != sk2
| X1 = nil ),
inference(global_subsumption_just,[status(thm)],[c_2940,c_78,c_2940]) ).
cnf(c_2943,plain,
( app(app(X0,X1),X2) != sk2
| app(X0,X2) != sk1
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| X1 = nil ),
inference(renaming,[status(thm)],[c_2942]) ).
cnf(c_9126,plain,
( app(sk6,sk7) != sk1
| ~ ssList(cons(sk5,nil))
| ~ ssList(sk6)
| ~ ssList(sk7)
| cons(sk5,nil) = nil ),
inference(superposition,[status(thm)],[c_1900,c_2943]) ).
cnf(c_9130,plain,
( ~ ssList(cons(sk5,nil))
| cons(sk5,nil) = nil ),
inference(forward_subsumption_resolution,[status(thm)],[c_9126,c_1612,c_1614,c_1712]) ).
cnf(c_9550,plain,
( ~ ssList(nil)
| ~ ssItem(sk5)
| cons(sk5,nil) = nil ),
inference(superposition,[status(thm)],[c_156,c_9130]) ).
cnf(c_9551,plain,
cons(sk5,nil) = nil,
inference(forward_subsumption_resolution,[status(thm)],[c_9550,c_1616,c_78]) ).
cnf(c_9623,plain,
( ~ ssList(nil)
| ~ ssItem(sk5)
| memberP(nil,sk5) ),
inference(superposition,[status(thm)],[c_9551,c_267]) ).
cnf(c_9625,plain,
memberP(nil,sk5),
inference(forward_subsumption_resolution,[status(thm)],[c_9623,c_1616,c_78]) ).
cnf(c_9632,plain,
~ ssItem(sk5),
inference(superposition,[status(thm)],[c_9625,c_141]) ).
cnf(c_9633,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_9632,c_1616]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC003-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Aug 28 14:21:04 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.70/1.17 % SZS status Started for theBenchmark.p
% 3.70/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 3.70/1.17
% 3.70/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.70/1.17
% 3.70/1.17 ------ iProver source info
% 3.70/1.17
% 3.70/1.17 git: date: 2023-05-31 18:12:56 +0000
% 3.70/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.70/1.17 git: non_committed_changes: false
% 3.70/1.17 git: last_make_outside_of_git: false
% 3.70/1.17
% 3.70/1.17 ------ Parsing...successful
% 3.70/1.17
% 3.70/1.17
% 3.70/1.17
% 3.70/1.17 ------ Preprocessing... sup_sim: 11 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
% 3.70/1.17
% 3.70/1.17 ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.70/1.17
% 3.70/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.70/1.17 ------ Proving...
% 3.70/1.17 ------ Problem Properties
% 3.70/1.17
% 3.70/1.17
% 3.70/1.17 clauses 190
% 3.70/1.17 conjectures 4
% 3.70/1.17 EPR 61
% 3.70/1.17 Horn 162
% 3.70/1.17 unary 68
% 3.70/1.17 binary 21
% 3.70/1.17 lits 565
% 3.70/1.17 lits eq 80
% 3.70/1.17 fd_pure 0
% 3.70/1.17 fd_pseudo 0
% 3.70/1.17 fd_cond 17
% 3.70/1.17 fd_pseudo_cond 14
% 3.70/1.17 AC symbols 0
% 3.70/1.17
% 3.70/1.17 ------ Schedule dynamic 5 is on
% 3.70/1.17
% 3.70/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.70/1.17
% 3.70/1.17
% 3.70/1.17 ------
% 3.70/1.17 Current options:
% 3.70/1.17 ------
% 3.70/1.17
% 3.70/1.17
% 3.70/1.17
% 3.70/1.17
% 3.70/1.17 ------ Proving...
% 3.70/1.17
% 3.70/1.17
% 3.70/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 3.70/1.17
% 3.70/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.70/1.17
% 3.70/1.17
%------------------------------------------------------------------------------