TSTP Solution File: SWC112-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC112-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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:41:04 EDT 2023
% Result : Unsatisfiable 0.47s 1.17s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of clauses : 32 ( 14 unt; 3 nHn; 32 RR)
% Number of literals : 80 ( 29 equ; 50 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(c_50,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
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,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(c_56,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(c_57,negated_conjecture,
app(app(sk5,sk3),sk6) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(c_61,negated_conjecture,
( sk3 != nil
| sk4 = nil ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(c_63,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1)
| sk2 = nil ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(c_64,negated_conjecture,
( sk1 != nil
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
cnf(c_73,plain,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(c_145,plain,
( ~ segmentP(nil,X0)
| ~ ssList(X0)
| X0 = nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause80) ).
cnf(c_165,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(c_180,plain,
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(c_238,plain,
( app(app(X0,X1),X2) != X3
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| segmentP(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(c_256,plain,
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(unflattening,[status(thm)],[c_180]) ).
cnf(c_265,plain,
( ~ ssList(app(app(X0,X1),X2))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| segmentP(app(app(X0,X1),X2),X1) ),
inference(unflattening,[status(thm)],[c_238]) ).
cnf(c_1662,plain,
app(app(sk5,sk1),sk6) = sk2,
inference(light_normalisation,[status(thm)],[c_57,c_53,c_54]) ).
cnf(c_1671,plain,
( sk1 != nil
| sk2 = nil ),
inference(light_normalisation,[status(thm)],[c_61,c_53,c_54]) ).
cnf(c_3514,plain,
( X0 != sk2
| X0 != nil
| sk1 != nil
| ~ ssList(X0) ),
inference(resolution_lifted,[status(thm)],[c_64,c_256]) ).
cnf(c_3515,plain,
( sk1 != nil
| sk2 != nil
| ~ ssList(sk2) ),
inference(unflattening,[status(thm)],[c_3514]) ).
cnf(c_3516,plain,
sk1 != nil,
inference(global_subsumption_just,[status(thm)],[c_3515,c_50,c_1671,c_3515]) ).
cnf(c_3547,plain,
( X0 != sk1
| X1 != nil
| ~ segmentP(sk2,sk1)
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| sk2 = nil ),
inference(resolution_lifted,[status(thm)],[c_63,c_165]) ).
cnf(c_3548,plain,
( ~ segmentP(sk2,sk1)
| ~ ssList(sk1)
| ~ ssList(nil)
| sk1 = nil
| sk2 = nil ),
inference(unflattening,[status(thm)],[c_3547]) ).
cnf(c_3549,plain,
( ~ segmentP(sk2,sk1)
| sk2 = nil ),
inference(global_subsumption_just,[status(thm)],[c_3548,c_49,c_73,c_3516,c_3548]) ).
cnf(c_9143,plain,
( ~ ssList(app(app(sk5,sk1),sk6))
| ~ ssList(sk1)
| ~ ssList(sk5)
| ~ ssList(sk6)
| segmentP(sk2,sk1) ),
inference(superposition,[status(thm)],[c_1662,c_265]) ).
cnf(c_9151,plain,
( ~ ssList(sk1)
| ~ ssList(sk2)
| ~ ssList(sk5)
| ~ ssList(sk6)
| segmentP(sk2,sk1) ),
inference(light_normalisation,[status(thm)],[c_9143,c_1662]) ).
cnf(c_9152,plain,
segmentP(sk2,sk1),
inference(forward_subsumption_resolution,[status(thm)],[c_9151,c_56,c_55,c_50,c_49]) ).
cnf(c_9159,plain,
sk2 = nil,
inference(backward_subsumption_resolution,[status(thm)],[c_3549,c_9152]) ).
cnf(c_9165,plain,
segmentP(nil,sk1),
inference(light_normalisation,[status(thm)],[c_9152,c_9159]) ).
cnf(c_9759,plain,
( ~ ssList(sk1)
| sk1 = nil ),
inference(superposition,[status(thm)],[c_9165,c_145]) ).
cnf(c_9762,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_9759,c_3516,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC112-1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 28 18:37:43 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.47/1.17 % SZS status Started for theBenchmark.p
% 0.47/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 0.47/1.17
% 0.47/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.47/1.17
% 0.47/1.17 ------ iProver source info
% 0.47/1.17
% 0.47/1.17 git: date: 2023-05-31 18:12:56 +0000
% 0.47/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.47/1.17 git: non_committed_changes: false
% 0.47/1.17 git: last_make_outside_of_git: false
% 0.47/1.17
% 0.47/1.17 ------ Parsing...successful
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17 ------ Preprocessing... sup_sim: 9 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
% 0.47/1.17
% 0.47/1.17 ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.47/1.17
% 0.47/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.47/1.17 ------ Proving...
% 0.47/1.17 ------ Problem Properties
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17 clauses 189
% 0.47/1.17 conjectures 6
% 0.47/1.17 EPR 61
% 0.47/1.17 Horn 161
% 0.47/1.17 unary 67
% 0.47/1.17 binary 22
% 0.47/1.17 lits 566
% 0.47/1.17 lits eq 78
% 0.47/1.17 fd_pure 0
% 0.47/1.17 fd_pseudo 0
% 0.47/1.17 fd_cond 15
% 0.47/1.17 fd_pseudo_cond 14
% 0.47/1.17 AC symbols 0
% 0.47/1.17
% 0.47/1.17 ------ Schedule dynamic 5 is on
% 0.47/1.17
% 0.47/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17 ------
% 0.47/1.17 Current options:
% 0.47/1.17 ------
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17 ------ Proving...
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 0.47/1.17
% 0.47/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.47/1.17
% 0.47/1.17
%------------------------------------------------------------------------------