TSTP Solution File: SWC181-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC181-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n015.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:30 EDT 2024
% Result : Unsatisfiable 28.28s 4.66s
% Output : CNFRefutation 28.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of clauses : 40 ( 14 unt; 2 nHn; 32 RR)
% Number of literals : 107 ( 11 equ; 70 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 57 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(c_54,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(c_58,negated_conjecture,
strictorderedP(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(c_61,negated_conjecture,
~ duplicatefreeP(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(c_80,plain,
ssList(skaf77(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause18) ).
cnf(c_81,plain,
ssList(skaf76(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause19) ).
cnf(c_82,plain,
ssList(skaf75(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause20) ).
cnf(c_134,plain,
( ~ ssList(X0)
| ssItem(X1)
| duplicatefreeP(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(c_147,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(c_148,plain,
( ~ ssList(X0)
| ~ ssItem(X1)
| ssList(cons(X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(c_173,plain,
( X0 != X1
| ~ lt(X0,X1)
| ~ ssItem(X0)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause111) ).
cnf(c_224,plain,
( ~ ssList(X0)
| app(app(skaf75(X0),cons(skaf74(X0),skaf76(X0))),cons(skaf74(X0),skaf77(X0))) = X0
| duplicatefreeP(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause162) ).
cnf(c_243,plain,
( app(app(X0,cons(X1,X2)),cons(X3,X4)) != X5
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ strictorderedP(X5)
| ~ ssItem(X1)
| ~ ssItem(X3)
| lt(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause181) ).
cnf(c_256,plain,
( ~ lt(X0,X0)
| ~ ssItem(X0) ),
inference(unflattening,[status(thm)],[c_173]) ).
cnf(c_267,plain,
( ~ ssList(app(app(X0,cons(X1,X2)),cons(X3,X4)))
| ~ strictorderedP(app(app(X0,cons(X1,X2)),cons(X3,X4)))
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssItem(X1)
| ~ ssItem(X3)
| lt(X1,X3) ),
inference(unflattening,[status(thm)],[c_243]) ).
cnf(c_1748,plain,
( X0 != sk1
| ~ ssList(X0)
| app(app(skaf75(X0),cons(skaf74(X0),skaf76(X0))),cons(skaf74(X0),skaf77(X0))) = X0 ),
inference(resolution_lifted,[status(thm)],[c_61,c_224]) ).
cnf(c_1749,plain,
( ~ ssList(sk1)
| app(app(skaf75(sk1),cons(skaf74(sk1),skaf76(sk1))),cons(skaf74(sk1),skaf77(sk1))) = sk1 ),
inference(unflattening,[status(thm)],[c_1748]) ).
cnf(c_1755,plain,
( X0 != sk1
| ~ ssList(X0)
| ssItem(X1) ),
inference(resolution_lifted,[status(thm)],[c_61,c_134]) ).
cnf(c_1756,plain,
( ~ ssList(sk1)
| ssItem(X0) ),
inference(unflattening,[status(thm)],[c_1755]) ).
cnf(c_1758,plain,
ssItem(X0),
inference(global_subsumption_just,[status(thm)],[c_1756,c_49,c_1756]) ).
cnf(c_1843,plain,
~ lt(X0,X0),
inference(backward_subsumption_resolution,[status(thm)],[c_256,c_1758]) ).
cnf(c_1867,plain,
( ~ ssList(app(app(X0,cons(X1,X2)),cons(X3,X4)))
| ~ strictorderedP(app(app(X0,cons(X1,X2)),cons(X3,X4)))
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssItem(X3)
| lt(X1,X3) ),
inference(backward_subsumption_resolution,[status(thm)],[c_267,c_1758]) ).
cnf(c_1888,plain,
( ~ ssList(X0)
| ssList(cons(X1,X0)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_148,c_1758]) ).
cnf(c_2699,plain,
( ~ ssList(app(app(X0,cons(X1,X2)),cons(X3,X4)))
| ~ strictorderedP(app(app(X0,cons(X1,X2)),cons(X3,X4)))
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssList(X4)
| lt(X1,X3) ),
inference(backward_subsumption_resolution,[status(thm)],[c_1867,c_1758]) ).
cnf(c_5778,plain,
( X0 != X1
| ~ strictorderedP(X1)
| strictorderedP(X0) ),
theory(equality) ).
cnf(c_7948,plain,
( ~ ssList(cons(X0,X1))
| ~ ssList(X2)
| ssList(app(X2,cons(X0,X1))) ),
inference(instantiation,[status(thm)],[c_147]) ).
cnf(c_7962,plain,
( app(app(X0,cons(X1,X2)),cons(X3,X4)) != X5
| ~ strictorderedP(X5)
| strictorderedP(app(app(X0,cons(X1,X2)),cons(X3,X4))) ),
inference(instantiation,[status(thm)],[c_5778]) ).
cnf(c_8791,plain,
( app(app(skaf75(sk1),cons(skaf74(sk1),skaf76(sk1))),cons(skaf74(sk1),skaf77(sk1))) != sk1
| ~ strictorderedP(sk1)
| strictorderedP(app(app(skaf75(sk1),cons(skaf74(sk1),skaf76(sk1))),cons(skaf74(sk1),skaf77(sk1)))) ),
inference(instantiation,[status(thm)],[c_7962]) ).
cnf(c_8800,plain,
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssList(cons(X1,X3))
| ssList(app(app(X0,cons(X1,X2)),cons(X1,X3))) ),
inference(instantiation,[status(thm)],[c_7948]) ).
cnf(c_18465,plain,
( ~ strictorderedP(sk3)
| strictorderedP(sk1) ),
inference(resolution,[status(thm)],[c_5778,c_54]) ).
cnf(c_24118,plain,
( ~ ssList(cons(skaf74(sk1),skaf76(sk1)))
| ~ ssList(skaf75(sk1))
| ssList(app(skaf75(sk1),cons(skaf74(sk1),skaf76(sk1)))) ),
inference(instantiation,[status(thm)],[c_7948]) ).
cnf(c_24133,plain,
ssList(skaf77(sk1)),
inference(instantiation,[status(thm)],[c_80]) ).
cnf(c_30487,plain,
ssList(skaf75(sk1)),
inference(instantiation,[status(thm)],[c_82]) ).
cnf(c_42903,plain,
( ~ ssList(skaf76(sk1))
| ssList(cons(skaf74(sk1),skaf76(sk1))) ),
inference(instantiation,[status(thm)],[c_1888]) ).
cnf(c_49789,plain,
( ~ ssList(app(app(skaf75(sk1),cons(skaf74(sk1),skaf76(sk1))),cons(skaf74(sk1),skaf77(sk1))))
| ~ strictorderedP(app(app(skaf75(sk1),cons(skaf74(sk1),skaf76(sk1))),cons(skaf74(sk1),skaf77(sk1))))
| ~ ssList(skaf77(sk1))
| ~ ssList(skaf76(sk1))
| ~ ssList(skaf75(sk1))
| lt(skaf74(sk1),skaf74(sk1)) ),
inference(instantiation,[status(thm)],[c_2699]) ).
cnf(c_52084,plain,
ssList(skaf76(sk1)),
inference(instantiation,[status(thm)],[c_81]) ).
cnf(c_54160,plain,
( ~ ssList(app(skaf75(sk1),cons(skaf74(sk1),skaf76(sk1))))
| ~ ssList(cons(skaf74(sk1),skaf77(sk1)))
| ssList(app(app(skaf75(sk1),cons(skaf74(sk1),skaf76(sk1))),cons(skaf74(sk1),skaf77(sk1)))) ),
inference(instantiation,[status(thm)],[c_8800]) ).
cnf(c_60699,plain,
( ~ ssList(skaf77(sk1))
| ssList(cons(skaf74(sk1),skaf77(sk1))) ),
inference(instantiation,[status(thm)],[c_1888]) ).
cnf(c_68081,plain,
~ lt(skaf74(sk1),skaf74(sk1)),
inference(instantiation,[status(thm)],[c_1843]) ).
cnf(c_68082,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_68081,c_60699,c_54160,c_52084,c_49789,c_42903,c_30487,c_24133,c_24118,c_18465,c_8791,c_1749,c_49,c_58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWC181-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.11 % Command : run_iprover %s %d THM
% 0.11/0.31 % Computer : n015.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:49:36 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.42 Running first-order theorem proving
% 0.17/0.42 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 28.28/4.66 % SZS status Started for theBenchmark.p
% 28.28/4.66 % SZS status Unsatisfiable for theBenchmark.p
% 28.28/4.66
% 28.28/4.66 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 28.28/4.66
% 28.28/4.66 ------ iProver source info
% 28.28/4.66
% 28.28/4.66 git: date: 2024-05-02 19:28:25 +0000
% 28.28/4.66 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 28.28/4.66 git: non_committed_changes: false
% 28.28/4.66
% 28.28/4.66 ------ Parsing...successful
% 28.28/4.66
% 28.28/4.66
% 28.28/4.66
% 28.28/4.66 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e
% 28.28/4.66
% 28.28/4.66 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 28.28/4.66
% 28.28/4.66 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 28.28/4.66 ------ Proving...
% 28.28/4.66 ------ Problem Properties
% 28.28/4.66
% 28.28/4.66
% 28.28/4.66 clauses 169
% 28.28/4.66 conjectures 12
% 28.28/4.66 EPR 57
% 28.28/4.66 Horn 143
% 28.28/4.66 unary 62
% 28.28/4.66 binary 25
% 28.28/4.66 lits 443
% 28.28/4.66 lits eq 78
% 28.28/4.66 fd_pure 0
% 28.28/4.66 fd_pseudo 0
% 28.28/4.66 fd_cond 14
% 28.28/4.66 fd_pseudo_cond 14
% 28.28/4.66 AC symbols 0
% 28.28/4.66
% 28.28/4.66 ------ Input Options Time Limit: Unbounded
% 28.28/4.66
% 28.28/4.66
% 28.28/4.66 ------
% 28.28/4.66 Current options:
% 28.28/4.66 ------
% 28.28/4.66
% 28.28/4.66
% 28.28/4.66
% 28.28/4.66
% 28.28/4.66 ------ Proving...
% 28.28/4.66
% 28.28/4.66
% 28.28/4.66 % SZS status Unsatisfiable for theBenchmark.p
% 28.28/4.66
% 28.28/4.66 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 28.28/4.66
% 28.28/4.66
%------------------------------------------------------------------------------