TSTP Solution File: SWC213-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC213-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n024.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:39 EDT 2024
% Result : Unsatisfiable 1.72s 1.19s
% Output : CNFRefutation 1.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 22 ( 14 unt; 1 nHn; 22 RR)
% Number of literals : 39 ( 17 equ; 25 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_51,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
cnf(c_52,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).
cnf(c_53,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(c_54,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(c_55,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(c_62,negated_conjecture,
~ neq(sk1,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(c_63,negated_conjecture,
( sk3 != nil
| sk4 = nil ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(c_71,plain,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(c_163,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(c_178,plain,
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(c_254,plain,
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(unflattening,[status(thm)],[c_178]) ).
cnf(c_1547,plain,
~ neq(sk3,nil),
inference(demodulation,[status(thm)],[c_62,c_54]) ).
cnf(c_1549,plain,
neq(sk4,nil),
inference(demodulation,[status(thm)],[c_55,c_53]) ).
cnf(c_2627,plain,
( X0 != nil
| X1 != sk3
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1 ),
inference(resolution_lifted,[status(thm)],[c_163,c_1547]) ).
cnf(c_2628,plain,
( ~ ssList(sk3)
| ~ ssList(nil)
| nil = sk3 ),
inference(unflattening,[status(thm)],[c_2627]) ).
cnf(c_2629,plain,
nil = sk3,
inference(global_subsumption_just,[status(thm)],[c_2628,c_51,c_71,c_2628]) ).
cnf(c_2634,plain,
( X0 != sk4
| X0 != nil
| ~ ssList(X0) ),
inference(resolution_lifted,[status(thm)],[c_254,c_1549]) ).
cnf(c_2635,plain,
( sk4 != nil
| ~ ssList(sk4) ),
inference(unflattening,[status(thm)],[c_2634]) ).
cnf(c_2636,plain,
sk4 != nil,
inference(global_subsumption_just,[status(thm)],[c_2635,c_52,c_2635]) ).
cnf(c_2651,plain,
sk3 != nil,
inference(backward_subsumption_resolution,[status(thm)],[c_63,c_2636]) ).
cnf(c_4625,plain,
nil != nil,
inference(demodulation,[status(thm)],[c_2651,c_2629]) ).
cnf(c_4626,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_4625]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC213-1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Jun 20 03:54:54 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.72/1.19 % SZS status Started for theBenchmark.p
% 1.72/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 1.72/1.19
% 1.72/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.72/1.19
% 1.72/1.19 ------ iProver source info
% 1.72/1.19
% 1.72/1.19 git: date: 2024-06-12 09:56:46 +0000
% 1.72/1.19 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 1.72/1.19 git: non_committed_changes: false
% 1.72/1.19
% 1.72/1.19 ------ Parsing...successful
% 1.72/1.19
% 1.72/1.19
% 1.72/1.19
% 1.72/1.19 ------ Preprocessing... sup_sim: 6 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e
% 1.72/1.19
% 1.72/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 1.72/1.19
% 1.72/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.72/1.19
% 1.72/1.19
%------------------------------------------------------------------------------