TSTP Solution File: SWC271-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC271-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n003.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:48 EDT 2024
% Result : Unsatisfiable 42.91s 6.67s
% Output : CNFRefutation 42.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 27 ( 17 unt; 2 nHn; 22 RR)
% Number of literals : 69 ( 5 equ; 42 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 20 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_51,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
cnf(c_54,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(c_56,negated_conjecture,
strictorderedP(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(c_58,negated_conjecture,
~ totalorderedP(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(c_85,plain,
ssList(skaf68(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause27) ).
cnf(c_86,plain,
ssList(skaf67(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause28) ).
cnf(c_87,plain,
ssList(skaf66(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause29) ).
cnf(c_88,plain,
ssItem(skaf65(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause30) ).
cnf(c_89,plain,
ssItem(skaf64(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause31) ).
cnf(c_149,plain,
( ~ leq(skaf64(X0),skaf65(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause91) ).
cnf(c_161,plain,
( ~ lt(X0,X1)
| ~ ssItem(X0)
| ~ ssItem(X1)
| leq(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause103) ).
cnf(c_222,plain,
( ~ ssList(X0)
| app(app(skaf66(X0),cons(skaf64(X0),skaf67(X0))),cons(skaf65(X0),skaf68(X0))) = X0
| totalorderedP(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause164) ).
cnf(c_239,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_263,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_239]) ).
cnf(c_1521,plain,
~ totalorderedP(sk3),
inference(demodulation,[status(thm)],[c_58,c_54]) ).
cnf(c_6365,negated_conjecture,
strictorderedP(sk3),
inference(demodulation,[status(thm)],[c_56]) ).
cnf(c_6370,negated_conjecture,
ssList(sk3),
inference(demodulation,[status(thm)],[c_51]) ).
cnf(c_10028,plain,
( ~ leq(skaf64(sk3),skaf65(sk3))
| ~ ssList(sk3)
| totalorderedP(sk3) ),
inference(instantiation,[status(thm)],[c_149]) ).
cnf(c_13925,plain,
( ~ lt(skaf64(sk3),skaf65(sk3))
| ~ ssItem(skaf65(sk3))
| ~ ssItem(skaf64(sk3))
| leq(skaf64(sk3),skaf65(sk3)) ),
inference(instantiation,[status(thm)],[c_161]) ).
cnf(c_17637,plain,
( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) = sk3
| totalorderedP(sk3) ),
inference(superposition,[status(thm)],[c_6370,c_222]) ).
cnf(c_17672,plain,
app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) = sk3,
inference(forward_subsumption_resolution,[status(thm)],[c_17637,c_1521]) ).
cnf(c_28842,plain,
ssItem(skaf65(sk3)),
inference(instantiation,[status(thm)],[c_88]) ).
cnf(c_30720,plain,
ssItem(skaf64(sk3)),
inference(instantiation,[status(thm)],[c_89]) ).
cnf(c_112355,plain,
( ~ strictorderedP(app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))))
| ~ ssList(skaf68(sk3))
| ~ ssList(skaf67(sk3))
| ~ ssList(skaf66(sk3))
| ~ ssItem(skaf65(sk3))
| ~ ssItem(skaf64(sk3))
| ~ ssList(sk3)
| lt(skaf64(sk3),skaf65(sk3)) ),
inference(superposition,[status(thm)],[c_17672,c_263]) ).
cnf(c_112421,plain,
( ~ ssList(skaf68(sk3))
| ~ ssList(skaf67(sk3))
| ~ ssList(skaf66(sk3))
| ~ ssItem(skaf65(sk3))
| ~ ssItem(skaf64(sk3))
| ~ ssList(sk3)
| ~ strictorderedP(sk3)
| lt(skaf64(sk3),skaf65(sk3)) ),
inference(light_normalisation,[status(thm)],[c_112355,c_17672]) ).
cnf(c_112422,plain,
lt(skaf64(sk3),skaf65(sk3)),
inference(forward_subsumption_resolution,[status(thm)],[c_112421,c_6365,c_6370,c_89,c_88,c_87,c_86,c_85]) ).
cnf(c_112488,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_112422,c_30720,c_28842,c_13925,c_10028,c_1521,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SWC271-1 : TPTP v8.1.2. Released v2.4.0.
% 0.05/0.11 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n003.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Thu May 2 23:35:20 EDT 2024
% 0.10/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
% 42.91/6.67 % SZS status Started for theBenchmark.p
% 42.91/6.67 % SZS status Unsatisfiable for theBenchmark.p
% 42.91/6.67
% 42.91/6.67 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 42.91/6.67
% 42.91/6.67 ------ iProver source info
% 42.91/6.67
% 42.91/6.67 git: date: 2024-05-02 19:28:25 +0000
% 42.91/6.67 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 42.91/6.67 git: non_committed_changes: false
% 42.91/6.67
% 42.91/6.67 ------ Parsing...successful
% 42.91/6.67
% 42.91/6.67
% 42.91/6.67
% 42.91/6.67 ------ Preprocessing... sup_sim: 5 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
% 42.91/6.67
% 42.91/6.67 ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 42.91/6.67
% 42.91/6.67 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 42.91/6.67 ------ Proving...
% 42.91/6.67 ------ Problem Properties
% 42.91/6.67
% 42.91/6.67
% 42.91/6.67 clauses 185
% 42.91/6.67 conjectures 6
% 42.91/6.67 EPR 60
% 42.91/6.67 Horn 157
% 42.91/6.67 unary 65
% 42.91/6.67 binary 21
% 42.91/6.67 lits 553
% 42.91/6.67 lits eq 72
% 42.91/6.67 fd_pure 0
% 42.91/6.67 fd_pseudo 0
% 42.91/6.67 fd_cond 16
% 42.91/6.67 fd_pseudo_cond 14
% 42.91/6.67 AC symbols 0
% 42.91/6.67
% 42.91/6.67 ------ Schedule dynamic 5 is on
% 42.91/6.67
% 42.91/6.67 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 42.91/6.67
% 42.91/6.67
% 42.91/6.67 ------
% 42.91/6.67 Current options:
% 42.91/6.67 ------
% 42.91/6.67
% 42.91/6.67
% 42.91/6.67
% 42.91/6.67
% 42.91/6.67 ------ Proving...
% 42.91/6.67
% 42.91/6.67
% 42.91/6.67 % SZS status Unsatisfiable for theBenchmark.p
% 42.91/6.67
% 42.91/6.67 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 42.91/6.67
% 42.91/6.67
%------------------------------------------------------------------------------