TSTP Solution File: SWC105-1 by Metis---2.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Metis---2.4
% Problem : SWC105-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : metis --show proof --show saturation %s
% Computer : n006.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 : 600s
% DateTime : Tue Jul 19 21:26:34 EDT 2022
% Result : Unsatisfiable 0.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 27
% Syntax : Number of clauses : 73 ( 16 unt; 10 nHn; 72 RR)
% Number of literals : 154 ( 77 equ; 78 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause8,axiom,
ssList(nil) ).
cnf(clause81,axiom,
( nil != U
| ~ ssList(U)
| rearsegP(nil,U) ) ).
cnf(clause82,axiom,
( ~ rearsegP(nil,U)
| ~ ssList(U)
| nil = U ) ).
cnf(co1_1,negated_conjecture,
ssList(sk1) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4 ).
cnf(co1_6,negated_conjecture,
sk1 = sk3 ).
cnf(co1_8,negated_conjecture,
( nil = sk2
| ~ neq(sk1,nil)
| ~ rearsegP(sk2,sk1) ) ).
cnf(co1_9,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ) ).
cnf(co1_10,negated_conjecture,
( nil != sk1
| ~ neq(sk1,nil)
| ~ rearsegP(sk2,sk1) ) ).
cnf(co1_11,negated_conjecture,
( nil = sk4
| neq(sk3,nil) ) ).
cnf(co1_12,negated_conjecture,
( nil = sk4
| rearsegP(sk4,sk3) ) ).
cnf(co1_14,negated_conjecture,
( nil = sk3
| rearsegP(sk4,sk3) ) ).
cnf(refute_0_0,plain,
nil = nil,
introduced(tautology,[refl,[$fot(nil)]]) ).
cnf(refute_0_1,plain,
( nil != nil
| nil != sk1
| sk1 = nil ),
introduced(tautology,[equality,[$cnf( $equal(nil,nil) ),[0],$fot(sk1)]]) ).
cnf(refute_0_2,plain,
( nil != sk1
| sk1 = nil ),
inference(resolve,[$cnf( $equal(nil,nil) )],[refute_0_0,refute_0_1]) ).
cnf(refute_0_3,plain,
( sk1 != nil
| ~ neq(nil,nil)
| neq(sk1,nil) ),
introduced(tautology,[equality,[$cnf( ~ neq(sk1,nil) ),[0],$fot(nil)]]) ).
cnf(refute_0_4,plain,
( nil != sk1
| ~ neq(nil,nil)
| neq(sk1,nil) ),
inference(resolve,[$cnf( $equal(sk1,nil) )],[refute_0_2,refute_0_3]) ).
cnf(refute_0_5,plain,
( nil != sk1
| ~ neq(nil,nil)
| ~ rearsegP(sk2,sk1) ),
inference(resolve,[$cnf( neq(sk1,nil) )],[refute_0_4,co1_10]) ).
cnf(refute_0_6,plain,
( sk1 != nil
| ~ rearsegP(sk2,nil)
| rearsegP(sk2,sk1) ),
introduced(tautology,[equality,[$cnf( ~ rearsegP(sk2,sk1) ),[1],$fot(nil)]]) ).
cnf(refute_0_7,plain,
( nil != sk1
| ~ rearsegP(sk2,nil)
| rearsegP(sk2,sk1) ),
inference(resolve,[$cnf( $equal(sk1,nil) )],[refute_0_2,refute_0_6]) ).
cnf(refute_0_8,plain,
( nil != sk1
| ~ neq(nil,nil)
| ~ rearsegP(sk2,nil) ),
inference(resolve,[$cnf( rearsegP(sk2,sk1) )],[refute_0_7,refute_0_5]) ).
cnf(refute_0_9,plain,
X = X,
introduced(tautology,[refl,[$fot(X)]]) ).
cnf(refute_0_10,plain,
( X != X
| X != Y
| Y = X ),
introduced(tautology,[equality,[$cnf( $equal(X,X) ),[0],$fot(Y)]]) ).
cnf(refute_0_11,plain,
( X != Y
| Y = X ),
inference(resolve,[$cnf( $equal(X,X) )],[refute_0_9,refute_0_10]) ).
cnf(refute_0_12,plain,
( sk2 != sk4
| sk4 = sk2 ),
inference(subst,[],[refute_0_11:[bind(X,$fot(sk2)),bind(Y,$fot(sk4))]]) ).
cnf(refute_0_13,plain,
sk4 = sk2,
inference(resolve,[$cnf( $equal(sk2,sk4) )],[co1_5,refute_0_12]) ).
cnf(refute_0_14,plain,
( nil != sk4
| sk4 != sk2
| nil = sk2 ),
introduced(tautology,[equality,[$cnf( ~ $equal(nil,sk2) ),[0],$fot(sk4)]]) ).
cnf(refute_0_15,plain,
( nil != sk4
| nil = sk2 ),
inference(resolve,[$cnf( $equal(sk4,sk2) )],[refute_0_13,refute_0_14]) ).
cnf(refute_0_16,plain,
( nil = sk2
| neq(sk3,nil) ),
inference(resolve,[$cnf( $equal(nil,sk4) )],[co1_11,refute_0_15]) ).
cnf(refute_0_17,plain,
( sk1 != sk3
| sk3 = sk1 ),
inference(subst,[],[refute_0_11:[bind(X,$fot(sk1)),bind(Y,$fot(sk3))]]) ).
cnf(refute_0_18,plain,
sk3 = sk1,
inference(resolve,[$cnf( $equal(sk1,sk3) )],[co1_6,refute_0_17]) ).
cnf(refute_0_19,plain,
( sk3 != sk1
| ~ neq(sk3,nil)
| neq(sk1,nil) ),
introduced(tautology,[equality,[$cnf( neq(sk3,nil) ),[0],$fot(sk1)]]) ).
cnf(refute_0_20,plain,
( ~ neq(sk3,nil)
| neq(sk1,nil) ),
inference(resolve,[$cnf( $equal(sk3,sk1) )],[refute_0_18,refute_0_19]) ).
cnf(refute_0_21,plain,
( nil = sk2
| neq(sk1,nil) ),
inference(resolve,[$cnf( neq(sk3,nil) )],[refute_0_16,refute_0_20]) ).
cnf(refute_0_22,plain,
( nil = sk2
| rearsegP(sk4,sk3) ),
inference(resolve,[$cnf( $equal(nil,sk4) )],[co1_12,refute_0_15]) ).
cnf(refute_0_23,plain,
( sk4 != sk2
| ~ rearsegP(sk4,sk3)
| rearsegP(sk2,sk3) ),
introduced(tautology,[equality,[$cnf( rearsegP(sk4,sk3) ),[0],$fot(sk2)]]) ).
cnf(refute_0_24,plain,
( ~ rearsegP(sk4,sk3)
| rearsegP(sk2,sk3) ),
inference(resolve,[$cnf( $equal(sk4,sk2) )],[refute_0_13,refute_0_23]) ).
cnf(refute_0_25,plain,
( sk3 != sk1
| ~ rearsegP(sk2,sk3)
| rearsegP(sk2,sk1) ),
introduced(tautology,[equality,[$cnf( rearsegP(sk2,sk3) ),[1],$fot(sk1)]]) ).
cnf(refute_0_26,plain,
( ~ rearsegP(sk2,sk3)
| rearsegP(sk2,sk1) ),
inference(resolve,[$cnf( $equal(sk3,sk1) )],[refute_0_18,refute_0_25]) ).
cnf(refute_0_27,plain,
( ~ rearsegP(sk4,sk3)
| rearsegP(sk2,sk1) ),
inference(resolve,[$cnf( rearsegP(sk2,sk3) )],[refute_0_24,refute_0_26]) ).
cnf(refute_0_28,plain,
( nil = sk2
| rearsegP(sk2,sk1) ),
inference(resolve,[$cnf( rearsegP(sk4,sk3) )],[refute_0_22,refute_0_27]) ).
cnf(refute_0_29,plain,
( ~ neq(sk1,nil)
| nil = sk2 ),
inference(resolve,[$cnf( rearsegP(sk2,sk1) )],[refute_0_28,co1_8]) ).
cnf(refute_0_30,plain,
nil = sk2,
inference(resolve,[$cnf( neq(sk1,nil) )],[refute_0_21,refute_0_29]) ).
cnf(refute_0_31,plain,
( nil != sk2
| sk2 = nil ),
inference(subst,[],[refute_0_11:[bind(X,$fot(nil)),bind(Y,$fot(sk2))]]) ).
cnf(refute_0_32,plain,
sk2 = nil,
inference(resolve,[$cnf( $equal(nil,sk2) )],[refute_0_30,refute_0_31]) ).
cnf(refute_0_33,plain,
( sk2 != nil
| ~ rearsegP(nil,nil)
| rearsegP(sk2,nil) ),
introduced(tautology,[equality,[$cnf( ~ rearsegP(sk2,nil) ),[0],$fot(nil)]]) ).
cnf(refute_0_34,plain,
( ~ rearsegP(nil,nil)
| rearsegP(sk2,nil) ),
inference(resolve,[$cnf( $equal(sk2,nil) )],[refute_0_32,refute_0_33]) ).
cnf(refute_0_35,plain,
( nil != sk1
| ~ neq(nil,nil)
| ~ rearsegP(nil,nil) ),
inference(resolve,[$cnf( rearsegP(sk2,nil) )],[refute_0_34,refute_0_8]) ).
cnf(refute_0_36,plain,
( nil != nil
| ~ ssList(nil)
| rearsegP(nil,nil) ),
inference(subst,[],[clause81:[bind(U,$fot(nil))]]) ).
cnf(refute_0_37,plain,
( ~ ssList(nil)
| rearsegP(nil,nil) ),
inference(resolve,[$cnf( $equal(nil,nil) )],[refute_0_0,refute_0_36]) ).
cnf(refute_0_38,plain,
rearsegP(nil,nil),
inference(resolve,[$cnf( ssList(nil) )],[clause8,refute_0_37]) ).
cnf(refute_0_39,plain,
( nil != sk1
| ~ neq(nil,nil) ),
inference(resolve,[$cnf( rearsegP(nil,nil) )],[refute_0_38,refute_0_35]) ).
cnf(refute_0_40,plain,
( nil != sk3
| sk3 != sk1
| nil = sk1 ),
introduced(tautology,[equality,[$cnf( ~ $equal(nil,sk1) ),[0],$fot(sk3)]]) ).
cnf(refute_0_41,plain,
( nil != sk3
| nil = sk1 ),
inference(resolve,[$cnf( $equal(sk3,sk1) )],[refute_0_18,refute_0_40]) ).
cnf(refute_0_42,plain,
( nil = sk1
| rearsegP(sk4,sk3) ),
inference(resolve,[$cnf( $equal(nil,sk3) )],[co1_14,refute_0_41]) ).
cnf(refute_0_43,plain,
( nil = sk1
| rearsegP(sk2,sk1) ),
inference(resolve,[$cnf( rearsegP(sk4,sk3) )],[refute_0_42,refute_0_27]) ).
cnf(refute_0_44,plain,
( sk2 != nil
| ~ rearsegP(sk2,sk1)
| rearsegP(nil,sk1) ),
introduced(tautology,[equality,[$cnf( rearsegP(sk2,sk1) ),[0],$fot(nil)]]) ).
cnf(refute_0_45,plain,
( ~ rearsegP(sk2,sk1)
| rearsegP(nil,sk1) ),
inference(resolve,[$cnf( $equal(sk2,nil) )],[refute_0_32,refute_0_44]) ).
cnf(refute_0_46,plain,
( nil = sk1
| rearsegP(nil,sk1) ),
inference(resolve,[$cnf( rearsegP(sk2,sk1) )],[refute_0_43,refute_0_45]) ).
cnf(refute_0_47,plain,
( ~ rearsegP(nil,sk1)
| ~ ssList(sk1)
| nil = sk1 ),
inference(subst,[],[clause82:[bind(U,$fot(sk1))]]) ).
cnf(refute_0_48,plain,
( ~ ssList(sk1)
| nil = sk1 ),
inference(resolve,[$cnf( rearsegP(nil,sk1) )],[refute_0_46,refute_0_47]) ).
cnf(refute_0_49,plain,
nil = sk1,
inference(resolve,[$cnf( ssList(sk1) )],[co1_1,refute_0_48]) ).
cnf(refute_0_50,plain,
sk1 = nil,
inference(resolve,[$cnf( $equal(nil,sk1) )],[refute_0_49,refute_0_2]) ).
cnf(refute_0_51,plain,
( nil != nil
| sk1 != nil
| nil = sk1 ),
introduced(tautology,[equality,[$cnf( ~ $equal(nil,sk1) ),[1],$fot(nil)]]) ).
cnf(refute_0_52,plain,
( nil != nil
| nil = sk1 ),
inference(resolve,[$cnf( $equal(sk1,nil) )],[refute_0_50,refute_0_51]) ).
cnf(refute_0_53,plain,
( nil != nil
| ~ neq(nil,nil) ),
inference(resolve,[$cnf( $equal(nil,sk1) )],[refute_0_52,refute_0_39]) ).
cnf(refute_0_54,plain,
~ neq(nil,nil),
inference(resolve,[$cnf( $equal(nil,nil) )],[refute_0_0,refute_0_53]) ).
cnf(refute_0_55,plain,
( sk2 != nil
| ~ neq(sk2,nil)
| neq(nil,nil) ),
introduced(tautology,[equality,[$cnf( neq(sk2,nil) ),[0],$fot(nil)]]) ).
cnf(refute_0_56,plain,
( ~ neq(sk2,nil)
| neq(nil,nil) ),
inference(resolve,[$cnf( $equal(sk2,nil) )],[refute_0_32,refute_0_55]) ).
cnf(refute_0_57,plain,
( nil != sk1
| neq(nil,nil) ),
inference(resolve,[$cnf( neq(sk2,nil) )],[co1_9,refute_0_56]) ).
cnf(refute_0_58,plain,
( nil != nil
| neq(nil,nil) ),
inference(resolve,[$cnf( $equal(nil,sk1) )],[refute_0_52,refute_0_57]) ).
cnf(refute_0_59,plain,
neq(nil,nil),
inference(resolve,[$cnf( $equal(nil,nil) )],[refute_0_0,refute_0_58]) ).
cnf(refute_0_60,plain,
$false,
inference(resolve,[$cnf( neq(nil,nil) )],[refute_0_59,refute_0_54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC105-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13 % Command : metis --show proof --show saturation %s
% 0.13/0.34 % Computer : n006.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 : 600
% 0.13/0.34 % DateTime : Sun Jun 12 04:56:27 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.20/0.53 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.53
% 0.20/0.53 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 0.20/0.53
%------------------------------------------------------------------------------