TSTP Solution File: SWC229-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC229-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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:40 EDT 2024
% Result : Unsatisfiable 107.74s 15.06s
% Output : CNFRefutation 107.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 21
% Syntax : Number of clauses : 70 ( 17 unt; 9 nHn; 69 RR)
% Number of literals : 201 ( 67 equ; 126 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 52 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(c_52,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_4) ).
cnf(c_54,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(c_55,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(c_56,negated_conjecture,
sk1 != nil,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(c_57,negated_conjecture,
( app(app(X0,cons(X1,nil)),X2) != sk1
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssItem(X1)
| ssItem(sk5(X2,X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(c_58,negated_conjecture,
( app(app(X0,cons(X1,nil)),X2) != sk1
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssItem(X1)
| memberP(X0,sk5(X2,X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(c_59,negated_conjecture,
( app(app(X0,cons(X1,nil)),X2) != sk1
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssItem(X1)
| memberP(X2,sk5(X2,X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(c_62,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(c_70,plain,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(c_109,plain,
ssItem(skaf44(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(c_123,plain,
( ~ ssList(X0)
| frontsegP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause61) ).
cnf(c_133,plain,
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(c_135,plain,
( ~ ssList(X0)
| app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(c_136,plain,
( ~ ssList(X0)
| app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(c_142,plain,
( ~ segmentP(nil,X0)
| ~ ssList(X0)
| X0 = nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause80) ).
cnf(c_146,plain,
( ~ frontsegP(nil,X0)
| ~ ssList(X0)
| X0 = nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause84) ).
cnf(c_162,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(c_163,plain,
( ~ ssList(X0)
| ~ singletonP(X0)
| cons(skaf44(X0),nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(c_314,plain,
( ~ ssList(nil)
| frontsegP(nil,nil) ),
inference(instantiation,[status(thm)],[c_123]) ).
cnf(c_332,plain,
( ~ frontsegP(nil,nil)
| ~ ssList(nil)
| nil = nil ),
inference(instantiation,[status(thm)],[c_146]) ).
cnf(c_428,plain,
( ~ neq(sk4,nil)
| singletonP(sk3) ),
inference(prop_impl_just,[status(thm)],[c_62]) ).
cnf(c_1674,plain,
( ~ neq(sk4,nil)
| singletonP(sk1) ),
inference(light_normalisation,[status(thm)],[c_428,c_54]) ).
cnf(c_1755,plain,
( X0 != sk4
| X1 != nil
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| singletonP(sk1) ),
inference(resolution_lifted,[status(thm)],[c_1674,c_162]) ).
cnf(c_1756,plain,
( ~ ssList(sk4)
| ~ ssList(nil)
| sk4 = nil
| singletonP(sk1) ),
inference(unflattening,[status(thm)],[c_1755]) ).
cnf(c_1757,plain,
( sk4 = nil
| singletonP(sk1) ),
inference(global_subsumption_just,[status(thm)],[c_1756,c_52,c_70,c_1756]) ).
cnf(c_1797,plain,
( X0 != sk1
| ~ ssList(X0)
| cons(skaf44(X0),nil) = X0
| sk4 = nil ),
inference(resolution_lifted,[status(thm)],[c_163,c_1757]) ).
cnf(c_1798,plain,
( ~ ssList(sk1)
| cons(skaf44(sk1),nil) = sk1
| sk4 = nil ),
inference(unflattening,[status(thm)],[c_1797]) ).
cnf(c_1799,plain,
( cons(skaf44(sk1),nil) = sk1
| sk4 = nil ),
inference(global_subsumption_just,[status(thm)],[c_1798,c_49,c_1798]) ).
cnf(c_2712,plain,
( singletonP(sk1)
| sk4 = nil ),
inference(prop_impl_just,[status(thm)],[c_1757]) ).
cnf(c_2713,plain,
( sk4 = nil
| singletonP(sk1) ),
inference(renaming,[status(thm)],[c_2712]) ).
cnf(c_4730,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_4732,plain,
( X0 != X1
| X2 != X3
| ~ segmentP(X1,X3)
| segmentP(X0,X2) ),
theory(equality) ).
cnf(c_7530,plain,
( ~ segmentP(nil,sk1)
| ~ ssList(sk1)
| sk1 = nil ),
inference(instantiation,[status(thm)],[c_142]) ).
cnf(c_7749,plain,
( sk1 != X0
| nil != X1
| ~ segmentP(X1,X0)
| segmentP(nil,sk1) ),
inference(instantiation,[status(thm)],[c_4732]) ).
cnf(c_8088,plain,
app(sk1,nil) = sk1,
inference(superposition,[status(thm)],[c_49,c_135]) ).
cnf(c_10892,plain,
( sk1 != sk3
| nil != X0
| ~ segmentP(X0,sk3)
| segmentP(nil,sk1) ),
inference(instantiation,[status(thm)],[c_7749]) ).
cnf(c_12406,plain,
( sk1 != sk3
| nil != sk4
| ~ segmentP(sk4,sk3)
| segmentP(nil,sk1) ),
inference(instantiation,[status(thm)],[c_10892]) ).
cnf(c_16867,plain,
( sk4 != X0
| nil != X0
| nil = sk4 ),
inference(instantiation,[status(thm)],[c_4730]) ).
cnf(c_16868,plain,
( sk4 != nil
| nil != nil
| nil = sk4 ),
inference(instantiation,[status(thm)],[c_16867]) ).
cnf(c_32790,plain,
singletonP(sk1),
inference(global_subsumption_just,[status(thm)],[c_2713,c_52,c_49,c_70,c_55,c_54,c_56,c_314,c_332,c_1756,c_7530,c_12406,c_16868]) ).
cnf(c_32836,plain,
app(nil,sk1) = sk1,
inference(superposition,[status(thm)],[c_49,c_136]) ).
cnf(c_33517,plain,
( ~ ssList(sk1)
| cons(skaf44(sk1),nil) = sk1 ),
inference(superposition,[status(thm)],[c_32790,c_163]) ).
cnf(c_52217,plain,
cons(skaf44(sk1),nil) = sk1,
inference(global_subsumption_just,[status(thm)],[c_33517,c_49,c_70,c_55,c_54,c_56,c_314,c_332,c_1798,c_7530,c_12406,c_16868]) ).
cnf(c_52229,plain,
( app(app(X0,sk1),X1) != sk1
| ~ ssItem(skaf44(sk1))
| ~ ssList(X0)
| ~ ssList(X1)
| memberP(X1,sk5(X1,X0,skaf44(sk1))) ),
inference(superposition,[status(thm)],[c_52217,c_59]) ).
cnf(c_52231,plain,
( app(app(X0,sk1),X1) != sk1
| ~ ssItem(skaf44(sk1))
| ~ ssList(X0)
| ~ ssList(X1)
| ssItem(sk5(X1,X0,skaf44(sk1))) ),
inference(superposition,[status(thm)],[c_52217,c_57]) ).
cnf(c_52503,plain,
( app(sk1,X0) != sk1
| ~ ssItem(skaf44(sk1))
| ~ ssList(X0)
| ~ ssList(nil)
| ssItem(sk5(X0,nil,skaf44(sk1))) ),
inference(superposition,[status(thm)],[c_32836,c_52231]) ).
cnf(c_52702,plain,
( app(sk1,X0) != sk1
| ~ ssItem(skaf44(sk1))
| ~ ssList(X0)
| ~ ssList(nil)
| memberP(X0,sk5(X0,nil,skaf44(sk1))) ),
inference(superposition,[status(thm)],[c_32836,c_52229]) ).
cnf(c_52721,plain,
( app(sk1,nil) != sk1
| ~ ssItem(skaf44(sk1))
| ~ ssList(nil)
| memberP(nil,sk5(nil,nil,skaf44(sk1))) ),
inference(instantiation,[status(thm)],[c_52702]) ).
cnf(c_114231,plain,
singletonP(sk1),
inference(global_subsumption_just,[status(thm)],[c_2713,c_49,c_70,c_55,c_54,c_56,c_314,c_332,c_1757,c_7530,c_12406,c_16868]) ).
cnf(c_114233,plain,
app(sk1,nil) = sk1,
inference(superposition,[status(thm)],[c_49,c_135]) ).
cnf(c_114265,plain,
app(nil,sk1) = sk1,
inference(superposition,[status(thm)],[c_49,c_136]) ).
cnf(c_114300,plain,
( ~ ssList(sk1)
| cons(skaf44(sk1),nil) = sk1 ),
inference(superposition,[status(thm)],[c_114231,c_163]) ).
cnf(c_114320,plain,
cons(skaf44(sk1),nil) = sk1,
inference(global_subsumption_just,[status(thm)],[c_114300,c_49,c_70,c_55,c_54,c_56,c_314,c_332,c_1799,c_7530,c_12406,c_16868]) ).
cnf(c_114331,plain,
( app(app(X0,sk1),X1) != sk1
| ~ ssItem(skaf44(sk1))
| ~ ssList(X0)
| ~ ssList(X1)
| memberP(X1,sk5(X1,X0,skaf44(sk1))) ),
inference(superposition,[status(thm)],[c_114320,c_59]) ).
cnf(c_114332,plain,
( app(app(X0,sk1),X1) != sk1
| ~ ssItem(skaf44(sk1))
| ~ ssList(X0)
| ~ ssList(X1)
| memberP(X0,sk5(X1,X0,skaf44(sk1))) ),
inference(superposition,[status(thm)],[c_114320,c_58]) ).
cnf(c_114333,plain,
( app(app(X0,sk1),X1) != sk1
| ~ ssItem(skaf44(sk1))
| ~ ssList(X0)
| ~ ssList(X1)
| ssItem(sk5(X1,X0,skaf44(sk1))) ),
inference(superposition,[status(thm)],[c_114320,c_57]) ).
cnf(c_114341,plain,
( app(sk1,X0) != sk1
| ~ ssItem(skaf44(sk1))
| ~ ssList(X0)
| ~ ssList(nil)
| ssItem(sk5(X0,nil,skaf44(sk1))) ),
inference(superposition,[status(thm)],[c_114265,c_114333]) ).
cnf(c_114356,plain,
( app(sk1,X0) != sk1
| ~ ssItem(skaf44(sk1))
| ~ ssList(X0)
| ~ ssList(nil)
| memberP(X0,sk5(X0,nil,skaf44(sk1))) ),
inference(superposition,[status(thm)],[c_114265,c_114331]) ).
cnf(c_114357,plain,
( app(sk1,X0) != sk1
| ~ ssItem(skaf44(sk1))
| ~ ssList(X0)
| ~ ssList(nil)
| memberP(nil,sk5(X0,nil,skaf44(sk1))) ),
inference(superposition,[status(thm)],[c_114265,c_114332]) ).
cnf(c_114360,plain,
( ~ ssList(X0)
| ~ ssItem(skaf44(sk1))
| app(sk1,X0) != sk1
| ssItem(sk5(X0,nil,skaf44(sk1))) ),
inference(global_subsumption_just,[status(thm)],[c_114341,c_70,c_52503]) ).
cnf(c_114361,plain,
( app(sk1,X0) != sk1
| ~ ssItem(skaf44(sk1))
| ~ ssList(X0)
| ssItem(sk5(X0,nil,skaf44(sk1))) ),
inference(renaming,[status(thm)],[c_114360]) ).
cnf(c_114362,plain,
( ~ ssItem(skaf44(sk1))
| ~ ssList(nil)
| ssItem(sk5(nil,nil,skaf44(sk1))) ),
inference(superposition,[status(thm)],[c_114233,c_114361]) ).
cnf(c_114365,plain,
( ~ ssList(X0)
| ~ ssItem(skaf44(sk1))
| app(sk1,X0) != sk1
| memberP(X0,sk5(X0,nil,skaf44(sk1))) ),
inference(global_subsumption_just,[status(thm)],[c_114356,c_70,c_52702]) ).
cnf(c_114366,plain,
( app(sk1,X0) != sk1
| ~ ssItem(skaf44(sk1))
| ~ ssList(X0)
| memberP(X0,sk5(X0,nil,skaf44(sk1))) ),
inference(renaming,[status(thm)],[c_114365]) ).
cnf(c_114367,plain,
( ~ ssItem(skaf44(sk1))
| ~ ssList(nil)
| memberP(nil,sk5(nil,nil,skaf44(sk1))) ),
inference(superposition,[status(thm)],[c_114233,c_114366]) ).
cnf(c_114382,plain,
( ~ ssItem(skaf44(sk1))
| memberP(nil,sk5(nil,nil,skaf44(sk1))) ),
inference(global_subsumption_just,[status(thm)],[c_114367,c_70,c_8088,c_52721]) ).
cnf(c_114384,plain,
( ~ ssItem(sk5(nil,nil,skaf44(sk1)))
| ~ ssItem(skaf44(sk1)) ),
inference(superposition,[status(thm)],[c_114382,c_133]) ).
cnf(c_114385,plain,
~ ssItem(skaf44(sk1)),
inference(global_subsumption_just,[status(thm)],[c_114357,c_70,c_114362,c_114384]) ).
cnf(c_114388,plain,
$false,
inference(superposition,[status(thm)],[c_109,c_114385]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SWC229-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.08 % Command : run_iprover %s %d THM
% 0.06/0.26 % Computer : n032.cluster.edu
% 0.06/0.26 % Model : x86_64 x86_64
% 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26 % Memory : 8042.1875MB
% 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26 % CPULimit : 300
% 0.06/0.26 % WCLimit : 300
% 0.06/0.26 % DateTime : Thu May 2 23:33:38 EDT 2024
% 0.06/0.26 % CPUTime :
% 0.10/0.34 Running first-order theorem proving
% 0.10/0.34 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
% 107.74/15.06 % SZS status Started for theBenchmark.p
% 107.74/15.06 % SZS status Unsatisfiable for theBenchmark.p
% 107.74/15.06
% 107.74/15.06 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 107.74/15.06
% 107.74/15.06 ------ iProver source info
% 107.74/15.06
% 107.74/15.06 git: date: 2024-05-02 19:28:25 +0000
% 107.74/15.06 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 107.74/15.06 git: non_committed_changes: false
% 107.74/15.06
% 107.74/15.06 ------ Parsing...successful
% 107.74/15.06
% 107.74/15.06
% 107.74/15.06
% 107.74/15.06 ------ Preprocessing... sup_sim: 1 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
% 107.74/15.06
% 107.74/15.06 ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 107.74/15.06
% 107.74/15.06 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 107.74/15.06 ------ Proving...
% 107.74/15.06 ------ Problem Properties
% 107.74/15.06
% 107.74/15.06
% 107.74/15.06 clauses 191
% 107.74/15.06 conjectures 13
% 107.74/15.06 EPR 61
% 107.74/15.06 Horn 162
% 107.74/15.06 unary 66
% 107.74/15.06 binary 22
% 107.74/15.06 lits 576
% 107.74/15.06 lits eq 78
% 107.74/15.06 fd_pure 0
% 107.74/15.06 fd_pseudo 0
% 107.74/15.06 fd_cond 15
% 107.74/15.06 fd_pseudo_cond 14
% 107.74/15.06 AC symbols 0
% 107.74/15.06
% 107.74/15.06 ------ Input Options Time Limit: Unbounded
% 107.74/15.06
% 107.74/15.06
% 107.74/15.06 ------
% 107.74/15.06 Current options:
% 107.74/15.06 ------
% 107.74/15.06
% 107.74/15.06
% 107.74/15.06
% 107.74/15.06
% 107.74/15.06 ------ Proving...
% 107.74/15.06
% 107.74/15.06
% 107.74/15.06 % SZS status Unsatisfiable for theBenchmark.p
% 107.74/15.06
% 107.74/15.06 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 107.74/15.06
% 107.74/15.07
%------------------------------------------------------------------------------