TSTP Solution File: SWC031-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC031-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 : Sat May 4 09:40:29 EDT 2024
% Result : Unsatisfiable 2.26s 0.81s
% Output : CNFRefutation 2.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 42
% Syntax : Number of clauses : 156 ( 49 unt; 23 nHn; 144 RR)
% Number of literals : 413 ( 116 equ; 250 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-2 aty)
% Number of variables : 194 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_10,negated_conjecture,
( nil = sk2
| nil = sk1 ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',co1_10) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',co1_5) ).
cnf(clause84,axiom,
( nil = X1
| ~ frontsegP(nil,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause84) ).
cnf(co1_7,negated_conjecture,
frontsegP(sk4,sk3),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',co1_7) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',co1_1) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause132) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',co1_2) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause74) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause8) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause173) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause51) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause73) ).
cnf(clause143,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause143) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause85) ).
cnf(clause168,axiom,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause168) ).
cnf(clause48,axiom,
ssList(skaf48(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause48) ).
cnf(clause136,axiom,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause136) ).
cnf(clause58,axiom,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause58) ).
cnf(clause131,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause131) ).
cnf(clause49,axiom,
ssList(skaf47(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause49) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause50) ).
cnf(co1_13,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',co1_13) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause104) ).
cnf(clause123,axiom,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause123) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause118) ).
cnf(clause171,axiom,
( X4 = X2
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause171) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause109) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause86) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause98) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause13) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause76) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause75) ).
cnf(clause178,axiom,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause178) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause97) ).
cnf(clause60,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause60) ).
cnf(co1_9,negated_conjecture,
( ~ ssList(X1)
| ~ neq(sk3,X1)
| ~ frontsegP(sk4,X1)
| ~ segmentP(X1,sk3)
| ~ totalorderedP(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',co1_9) ).
cnf(clause56,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause56) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause100) ).
cnf(clause67,axiom,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause67) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p',clause99) ).
cnf(c_0_42,negated_conjecture,
( nil = sk2
| nil = sk1 ),
co1_10 ).
cnf(c_0_43,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_44,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_45,plain,
( nil = X1
| ~ frontsegP(nil,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause84]) ).
cnf(c_0_46,negated_conjecture,
frontsegP(sk4,sk3),
co1_7 ).
cnf(c_0_47,negated_conjecture,
( sk4 = nil
| sk3 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_48,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_49,plain,
( nil = X1
| ~ frontsegP(nil,X1)
| ~ ssList(X1) ),
c_0_45 ).
cnf(c_0_50,negated_conjecture,
( sk3 = nil
| frontsegP(nil,sk3) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_48,c_0_43]) ).
cnf(c_0_52,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_53,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]) ).
cnf(c_0_54,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_55,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_56,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_52 ).
cnf(c_0_57,negated_conjecture,
frontsegP(sk4,nil),
inference(rw,[status(thm)],[c_0_46,c_0_53]) ).
cnf(c_0_58,axiom,
ssList(nil),
clause8 ).
cnf(c_0_59,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_54,c_0_44]) ).
cnf(c_0_60,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
inference(fof_simplification,[status(thm)],[clause173]) ).
cnf(c_0_61,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_55 ).
cnf(c_0_62,negated_conjecture,
app(nil,skaf45(sk4,nil)) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]),c_0_59])]) ).
cnf(c_0_63,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_64,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
c_0_60 ).
cnf(c_0_65,negated_conjecture,
skaf45(sk4,nil) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63])]) ).
cnf(c_0_66,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_64]) ).
cnf(c_0_67,negated_conjecture,
app(nil,sk4) = sk4,
inference(rw,[status(thm)],[c_0_62,c_0_65]) ).
cnf(c_0_68,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_69,plain,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause143]) ).
cnf(c_0_70,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_71,plain,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause168]) ).
cnf(c_0_72,negated_conjecture,
( segmentP(app(sk4,X1),sk4)
| ~ ssList(app(sk4,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_59]),c_0_58])]) ).
cnf(c_0_73,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
c_0_68 ).
cnf(c_0_74,plain,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_69 ).
cnf(c_0_75,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_70 ).
cnf(c_0_76,plain,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_71 ).
cnf(c_0_77,negated_conjecture,
segmentP(sk4,sk4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_59]),c_0_58])]) ).
cnf(c_0_78,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_74]),c_0_75]) ).
cnf(c_0_79,negated_conjecture,
app(app(skaf47(sk4,sk4),sk4),skaf48(sk4,sk4)) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_59])]) ).
cnf(c_0_80,axiom,
ssList(skaf48(X1,X2)),
clause48 ).
cnf(c_0_81,plain,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause136]) ).
cnf(c_0_82,plain,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause58]) ).
cnf(c_0_83,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_84,negated_conjecture,
( rearsegP(sk4,skaf48(sk4,sk4))
| ~ ssList(app(skaf47(sk4,sk4),sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80])]) ).
cnf(c_0_85,axiom,
ssList(skaf47(X1,X2)),
clause49 ).
cnf(c_0_86,plain,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_81 ).
cnf(c_0_87,plain,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
c_0_82 ).
cnf(c_0_88,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_83 ).
cnf(c_0_89,negated_conjecture,
rearsegP(sk4,skaf48(sk4,sk4)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_75]),c_0_85]),c_0_59])]) ).
cnf(c_0_90,plain,
( rearsegP(app(X1,X2),nil)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_58])]) ).
cnf(c_0_91,negated_conjecture,
app(skaf46(sk4,skaf48(sk4,sk4)),skaf48(sk4,sk4)) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_80]),c_0_59])]) ).
cnf(c_0_92,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_93,negated_conjecture,
rearsegP(sk4,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_92]),c_0_80])]) ).
cnf(c_0_94,negated_conjecture,
( nil != sk1
| nil != sk2 ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_95,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_96,plain,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause123]) ).
cnf(c_0_97,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_98,negated_conjecture,
app(skaf46(sk4,nil),nil) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_93]),c_0_58]),c_0_59])]) ).
cnf(c_0_99,negated_conjecture,
( nil != sk1
| nil != sk2 ),
c_0_94 ).
cnf(c_0_100,plain,
( X4 = X2
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause171]) ).
cnf(c_0_101,plain,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_102,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_103,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_104,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_95 ).
cnf(c_0_105,plain,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_96 ).
cnf(c_0_106,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_97 ).
cnf(c_0_107,negated_conjecture,
skaf46(sk4,nil) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_98]),c_0_92])]) ).
cnf(c_0_108,negated_conjecture,
( sk3 != nil
| sk4 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_43]),c_0_44]) ).
cnf(c_0_109,plain,
( X4 = X2
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
c_0_100 ).
cnf(c_0_110,plain,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_101 ).
cnf(c_0_111,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_112,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_113,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_102 ).
cnf(c_0_114,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_103 ).
cnf(c_0_115,plain,
( cons(hd(X1),tl(app(X1,X2))) = app(X1,X2)
| nil = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_75]),c_0_106]) ).
cnf(c_0_116,negated_conjecture,
app(sk4,nil) = sk4,
inference(rw,[status(thm)],[c_0_98,c_0_107]) ).
cnf(c_0_117,negated_conjecture,
sk4 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_108,c_0_53])]) ).
cnf(c_0_118,plain,
( skaf82(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_111]),c_0_112])])]),c_0_113]),c_0_114]) ).
cnf(c_0_119,negated_conjecture,
cons(hd(sk4),tl(sk4)) = sk4,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_59]),c_0_58])]),c_0_117]) ).
cnf(c_0_120,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_121,negated_conjecture,
( skaf82(sk4) = tl(sk4)
| ~ ssItem(hd(sk4))
| ~ ssList(tl(sk4)) ),
inference(spm,[status(thm)],[c_0_118,c_0_119]) ).
cnf(c_0_122,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_120 ).
cnf(c_0_123,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_124,negated_conjecture,
( skaf82(sk4) = tl(sk4)
| ~ ssList(tl(sk4)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_59])]),c_0_117]) ).
cnf(c_0_125,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_123 ).
cnf(c_0_126,plain,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
inference(fof_simplification,[status(thm)],[clause178]) ).
cnf(c_0_127,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_128,negated_conjecture,
skaf82(sk4) = tl(sk4),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_59])]),c_0_117]) ).
cnf(c_0_129,plain,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
c_0_126 ).
cnf(c_0_130,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause60]) ).
cnf(c_0_131,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_127 ).
cnf(c_0_132,negated_conjecture,
cons(skaf83(sk4),tl(sk4)) = sk4,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_128]),c_0_59])]),c_0_117]) ).
cnf(c_0_133,negated_conjecture,
ssList(tl(sk4)),
inference(spm,[status(thm)],[c_0_112,c_0_128]) ).
cnf(c_0_134,negated_conjecture,
( ~ ssList(X1)
| ~ neq(sk3,X1)
| ~ frontsegP(sk4,X1)
| ~ segmentP(X1,sk3)
| ~ totalorderedP(X1) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_135,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause56]) ).
cnf(c_0_136,plain,
( frontsegP(cons(X1,X2),cons(X1,X3))
| ~ frontsegP(X2,X3)
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_129]) ).
cnf(c_0_137,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
c_0_130 ).
cnf(c_0_138,negated_conjecture,
skaf83(sk4) = hd(sk4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_132]),c_0_111]),c_0_133])]) ).
cnf(c_0_139,negated_conjecture,
( ~ ssList(X1)
| ~ neq(sk3,X1)
| ~ frontsegP(sk4,X1)
| ~ segmentP(X1,sk3)
| ~ totalorderedP(X1) ),
c_0_134 ).
cnf(c_0_140,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
c_0_135 ).
cnf(c_0_141,plain,
( frontsegP(cons(X1,X2),cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_137]),c_0_58])]) ).
cnf(c_0_142,negated_conjecture,
ssItem(hd(sk4)),
inference(spm,[status(thm)],[c_0_111,c_0_138]) ).
cnf(c_0_143,negated_conjecture,
( ~ neq(nil,X1)
| ~ frontsegP(sk4,X1)
| ~ ssList(X1)
| ~ totalorderedP(X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_139,c_0_53]),c_0_53]),c_0_140]) ).
cnf(c_0_144,negated_conjecture,
frontsegP(sk4,cons(hd(sk4),nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_119]),c_0_142]),c_0_133])]) ).
cnf(c_0_145,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_146,negated_conjecture,
( ~ neq(nil,cons(hd(sk4),nil))
| ~ ssList(cons(hd(sk4),nil))
| ~ totalorderedP(cons(hd(sk4),nil)) ),
inference(spm,[status(thm)],[c_0_143,c_0_144]) ).
cnf(c_0_147,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_145 ).
cnf(c_0_148,negated_conjecture,
( cons(hd(sk4),nil) = nil
| ~ ssList(cons(hd(sk4),nil))
| ~ totalorderedP(cons(hd(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_147]),c_0_58])]) ).
cnf(c_0_149,plain,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause67]) ).
cnf(c_0_150,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_151,negated_conjecture,
( cons(hd(sk4),nil) = nil
| ~ totalorderedP(cons(hd(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_148,c_0_113]),c_0_142]),c_0_58])]) ).
cnf(c_0_152,plain,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
c_0_149 ).
cnf(c_0_153,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_150 ).
cnf(c_0_154,negated_conjecture,
cons(hd(sk4),nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_151,c_0_152]),c_0_142])]) ).
cnf(c_0_155,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_153,c_0_154]),c_0_142]),c_0_58])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC031-1 : TPTP v8.1.2. Released v2.4.0.
% 0.14/0.14 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n016.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.20/0.34 % WCLimit : 300
% 0.20/0.34 % DateTime : Fri May 3 15:33:38 EDT 2024
% 0.20/0.34 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.1QZQkoqdX2/E---3.1_20920.p
% 2.26/0.81 # Version: 3.1.0
% 2.26/0.81 # Preprocessing class: FSLSSMSSSSSNFFN.
% 2.26/0.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.26/0.81 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.26/0.81 # Starting new_bool_3 with 300s (1) cores
% 2.26/0.81 # Starting new_bool_1 with 300s (1) cores
% 2.26/0.81 # Starting sh5l with 300s (1) cores
% 2.26/0.81 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 21057 completed with status 0
% 2.26/0.81 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 2.26/0.81 # Preprocessing class: FSLSSMSSSSSNFFN.
% 2.26/0.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.26/0.81 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.26/0.81 # No SInE strategy applied
% 2.26/0.81 # Search class: FGHSM-FSLM21-MFFFFFNN
% 2.26/0.81 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 2.26/0.81 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 2.26/0.81 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 2.26/0.81 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 2.26/0.81 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 2.26/0.81 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 2.26/0.81 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 21065 completed with status 0
% 2.26/0.81 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 2.26/0.81 # Preprocessing class: FSLSSMSSSSSNFFN.
% 2.26/0.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.26/0.81 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.26/0.81 # No SInE strategy applied
% 2.26/0.81 # Search class: FGHSM-FSLM21-MFFFFFNN
% 2.26/0.81 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 2.26/0.81 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 2.26/0.81 # Preprocessing time : 0.003 s
% 2.26/0.81 # Presaturation interreduction done
% 2.26/0.81
% 2.26/0.81 # Proof found!
% 2.26/0.81 # SZS status Unsatisfiable
% 2.26/0.81 # SZS output start CNFRefutation
% See solution above
% 2.26/0.81 # Parsed axioms : 198
% 2.26/0.81 # Removed by relevancy pruning/SinE : 0
% 2.26/0.81 # Initial clauses : 198
% 2.26/0.81 # Removed in clause preprocessing : 2
% 2.26/0.81 # Initial clauses in saturation : 196
% 2.26/0.81 # Processed clauses : 3755
% 2.26/0.81 # ...of these trivial : 24
% 2.26/0.81 # ...subsumed : 2519
% 2.26/0.81 # ...remaining for further processing : 1212
% 2.26/0.81 # Other redundant clauses eliminated : 319
% 2.26/0.81 # Clauses deleted for lack of memory : 0
% 2.26/0.81 # Backward-subsumed : 45
% 2.26/0.81 # Backward-rewritten : 146
% 2.26/0.81 # Generated clauses : 14557
% 2.26/0.81 # ...of the previous two non-redundant : 13021
% 2.26/0.81 # ...aggressively subsumed : 0
% 2.26/0.81 # Contextual simplify-reflections : 212
% 2.26/0.81 # Paramodulations : 14230
% 2.26/0.81 # Factorizations : 0
% 2.26/0.81 # NegExts : 0
% 2.26/0.81 # Equation resolutions : 328
% 2.26/0.81 # Disequality decompositions : 0
% 2.26/0.81 # Total rewrite steps : 15581
% 2.26/0.81 # ...of those cached : 15228
% 2.26/0.81 # Propositional unsat checks : 0
% 2.26/0.81 # Propositional check models : 0
% 2.26/0.81 # Propositional check unsatisfiable : 0
% 2.26/0.81 # Propositional clauses : 0
% 2.26/0.81 # Propositional clauses after purity: 0
% 2.26/0.81 # Propositional unsat core size : 0
% 2.26/0.81 # Propositional preprocessing time : 0.000
% 2.26/0.81 # Propositional encoding time : 0.000
% 2.26/0.81 # Propositional solver time : 0.000
% 2.26/0.81 # Success case prop preproc time : 0.000
% 2.26/0.81 # Success case prop encoding time : 0.000
% 2.26/0.81 # Success case prop solver time : 0.000
% 2.26/0.81 # Current number of processed clauses : 810
% 2.26/0.81 # Positive orientable unit clauses : 110
% 2.26/0.81 # Positive unorientable unit clauses: 0
% 2.26/0.81 # Negative unit clauses : 14
% 2.26/0.81 # Non-unit-clauses : 686
% 2.26/0.81 # Current number of unprocessed clauses: 9362
% 2.26/0.81 # ...number of literals in the above : 52788
% 2.26/0.81 # Current number of archived formulas : 0
% 2.26/0.81 # Current number of archived clauses : 379
% 2.26/0.81 # Clause-clause subsumption calls (NU) : 133629
% 2.26/0.81 # Rec. Clause-clause subsumption calls : 27986
% 2.26/0.81 # Non-unit clause-clause subsumptions : 1776
% 2.26/0.81 # Unit Clause-clause subsumption calls : 3786
% 2.26/0.81 # Rewrite failures with RHS unbound : 0
% 2.26/0.81 # BW rewrite match attempts : 40
% 2.26/0.81 # BW rewrite match successes : 40
% 2.26/0.81 # Condensation attempts : 0
% 2.26/0.81 # Condensation successes : 0
% 2.26/0.81 # Termbank termtop insertions : 275364
% 2.26/0.81 # Search garbage collected termcells : 543
% 2.26/0.81
% 2.26/0.81 # -------------------------------------------------
% 2.26/0.81 # User time : 0.295 s
% 2.26/0.81 # System time : 0.009 s
% 2.26/0.81 # Total time : 0.303 s
% 2.26/0.81 # Maximum resident set size: 2148 pages
% 2.26/0.81
% 2.26/0.81 # -------------------------------------------------
% 2.26/0.81 # User time : 1.433 s
% 2.26/0.81 # System time : 0.057 s
% 2.26/0.81 # Total time : 1.490 s
% 2.26/0.81 # Maximum resident set size: 1868 pages
% 2.26/0.81 % E---3.1 exiting
%------------------------------------------------------------------------------