TSTP Solution File: SWC264-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC264-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n004.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 : Mon Jun 24 16:23:58 EDT 2024
% Result : Unsatisfiable 10.42s 2.24s
% Output : CNFRefutation 10.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of clauses : 26 ( 16 unt; 2 nHn; 21 RR)
% Number of literals : 67 ( 5 equ; 41 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_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_55,negated_conjecture,
strictorderedP(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(c_56,negated_conjecture,
~ totalorderedP(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(c_83,plain,
ssList(skaf68(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause27) ).
cnf(c_84,plain,
ssList(skaf67(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause28) ).
cnf(c_85,plain,
ssList(skaf66(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause29) ).
cnf(c_86,plain,
ssItem(skaf65(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause30) ).
cnf(c_87,plain,
ssItem(skaf64(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause31) ).
cnf(c_147,plain,
( ~ leq(skaf64(X0),skaf65(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause91) ).
cnf(c_159,plain,
( ~ lt(X0,X1)
| ~ ssItem(X0)
| ~ ssItem(X1)
| leq(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause103) ).
cnf(c_220,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_237,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_261,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_237]) ).
cnf(c_1507,plain,
strictorderedP(sk1),
inference(demodulation,[status(thm)],[c_55,c_54]) ).
cnf(c_6267,negated_conjecture,
~ totalorderedP(sk1),
inference(demodulation,[status(thm)],[c_56]) ).
cnf(c_6271,negated_conjecture,
ssList(sk1),
inference(demodulation,[status(thm)],[c_49]) ).
cnf(c_9742,plain,
( ~ leq(skaf64(sk1),skaf65(sk1))
| ~ ssList(sk1)
| totalorderedP(sk1) ),
inference(instantiation,[status(thm)],[c_147]) ).
cnf(c_16894,plain,
( app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))) = sk1
| totalorderedP(sk1) ),
inference(superposition,[status(thm)],[c_6271,c_220]) ).
cnf(c_16929,plain,
app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))) = sk1,
inference(forward_subsumption_resolution,[status(thm)],[c_16894,c_6267]) ).
cnf(c_22605,plain,
( ~ strictorderedP(app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))))
| ~ ssList(skaf68(sk1))
| ~ ssList(skaf67(sk1))
| ~ ssList(skaf66(sk1))
| ~ ssItem(skaf65(sk1))
| ~ ssItem(skaf64(sk1))
| ~ ssList(sk1)
| lt(skaf64(sk1),skaf65(sk1)) ),
inference(superposition,[status(thm)],[c_16929,c_261]) ).
cnf(c_22658,plain,
( ~ ssList(skaf68(sk1))
| ~ ssList(skaf67(sk1))
| ~ ssList(skaf66(sk1))
| ~ ssItem(skaf65(sk1))
| ~ ssItem(skaf64(sk1))
| ~ ssList(sk1)
| ~ strictorderedP(sk1)
| lt(skaf64(sk1),skaf65(sk1)) ),
inference(light_normalisation,[status(thm)],[c_22605,c_16929]) ).
cnf(c_22659,plain,
lt(skaf64(sk1),skaf65(sk1)),
inference(forward_subsumption_resolution,[status(thm)],[c_22658,c_1507,c_6271,c_87,c_86,c_85,c_84,c_83]) ).
cnf(c_22729,plain,
( ~ ssItem(skaf65(sk1))
| ~ ssItem(skaf64(sk1))
| leq(skaf64(sk1),skaf65(sk1)) ),
inference(superposition,[status(thm)],[c_22659,c_159]) ).
cnf(c_22730,plain,
leq(skaf64(sk1),skaf65(sk1)),
inference(forward_subsumption_resolution,[status(thm)],[c_22729,c_87,c_86]) ).
cnf(c_22737,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_22730,c_9742,c_56,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC264-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Jun 20 01:37:54 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.20/0.50 Running first-order theorem proving
% 0.20/0.50 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
% 10.42/2.24 % SZS status Started for theBenchmark.p
% 10.42/2.24 % SZS status Unsatisfiable for theBenchmark.p
% 10.42/2.24
% 10.42/2.24 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 10.42/2.24
% 10.42/2.24 ------ iProver source info
% 10.42/2.24
% 10.42/2.24 git: date: 2024-06-12 09:56:46 +0000
% 10.42/2.24 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 10.42/2.24 git: non_committed_changes: false
% 10.42/2.24
% 10.42/2.24 ------ Parsing...successful
% 10.42/2.24
% 10.42/2.24
% 10.42/2.24
% 10.42/2.24 ------ Preprocessing... sup_sim: 5 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 10.42/2.24
% 10.42/2.24 ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 10.42/2.24
% 10.42/2.24 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 10.42/2.24 ------ Proving...
% 10.42/2.24 ------ Problem Properties
% 10.42/2.24
% 10.42/2.24
% 10.42/2.24 clauses 183
% 10.42/2.24 conjectures 5
% 10.42/2.24 EPR 58
% 10.42/2.24 Horn 155
% 10.42/2.24 unary 64
% 10.42/2.24 binary 21
% 10.42/2.24 lits 547
% 10.42/2.24 lits eq 71
% 10.42/2.24 fd_pure 0
% 10.42/2.24 fd_pseudo 0
% 10.42/2.24 fd_cond 15
% 10.42/2.24 fd_pseudo_cond 14
% 10.42/2.24 AC symbols 0
% 10.42/2.24
% 10.42/2.24 ------ Schedule dynamic 5 is on
% 10.42/2.24
% 10.42/2.24 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 10.42/2.24
% 10.42/2.24
% 10.42/2.24 ------
% 10.42/2.24 Current options:
% 10.42/2.24 ------
% 10.42/2.24
% 10.42/2.24
% 10.42/2.24
% 10.42/2.24
% 10.42/2.24 ------ Proving...
% 10.42/2.24
% 10.42/2.24
% 10.42/2.24 % SZS status Unsatisfiable for theBenchmark.p
% 10.42/2.24
% 10.42/2.24 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.42/2.24
% 10.42/2.24
%------------------------------------------------------------------------------