TSTP Solution File: SWC418-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC418-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:43:05 EDT 2023
% Result : Unsatisfiable 0.91s 0.60s
% Output : CNFRefutation 0.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 25
% Syntax : Number of clauses : 90 ( 23 unt; 15 nHn; 72 RR)
% Number of literals : 281 ( 86 equ; 188 neg)
% Maximal clause size : 12 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 131 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause179,axiom,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
file('/export/starexec/sandbox2/tmp/tmp.REfKsuuLA8/E---3.1_25558.p',clause179) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.REfKsuuLA8/E---3.1_25558.p',clause72) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.REfKsuuLA8/E---3.1_25558.p',clause74) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.REfKsuuLA8/E---3.1_25558.p',clause8) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.REfKsuuLA8/E---3.1_25558.p',clause86) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.REfKsuuLA8/E---3.1_25558.p',clause120) ).
cnf(co1_10,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk4) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk4) != X4
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.REfKsuuLA8/E---3.1_25558.p',co1_10) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/tmp/tmp.REfKsuuLA8/E---3.1_25558.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.REfKsuuLA8/E---3.1_25558.p',co1_5) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.REfKsuuLA8/E---3.1_25558.p',clause85) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.REfKsuuLA8/E---3.1_25558.p',co1_2) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.REfKsuuLA8/E---3.1_25558.p',clause53) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.REfKsuuLA8/E---3.1_25558.p',clause100) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox2/tmp/tmp.REfKsuuLA8/E---3.1_25558.p',clause47) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.REfKsuuLA8/E---3.1_25558.p',clause76) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.REfKsuuLA8/E---3.1_25558.p',clause97) ).
cnf(clause116,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.REfKsuuLA8/E---3.1_25558.p',clause116) ).
cnf(co1_8,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk2
| app(app(X3,cons(X1,nil)),X2) != sk1 ),
file('/export/starexec/sandbox2/tmp/tmp.REfKsuuLA8/E---3.1_25558.p',co1_8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.REfKsuuLA8/E---3.1_25558.p',co1_6) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.REfKsuuLA8/E---3.1_25558.p',clause75) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.REfKsuuLA8/E---3.1_25558.p',clause101) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.REfKsuuLA8/E---3.1_25558.p',clause73) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.REfKsuuLA8/E---3.1_25558.p',clause157) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.REfKsuuLA8/E---3.1_25558.p',clause104) ).
cnf(clause117,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.REfKsuuLA8/E---3.1_25558.p',clause117) ).
cnf(c_0_25,axiom,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
clause179 ).
cnf(c_0_26,plain,
( ~ ssItem(X1)
| ~ ssList(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ duplicatefreeP(app(app(X2,cons(X1,X3)),cons(X1,X4))) ),
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_27,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_28,plain,
( ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(app(app(X3,cons(X2,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_30,axiom,
ssList(nil),
clause8 ).
cnf(c_0_31,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_32,plain,
( ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(app(cons(X2,X3),cons(X2,X4)))
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]),c_0_31]) ).
cnf(c_0_33,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_34,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk4) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk4) != X4
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
co1_10 ).
cnf(c_0_35,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_36,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_37,plain,
( ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(cons(X2,cons(X2,X3)))
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_30])]),c_0_31]) ).
cnf(c_0_38,negated_conjecture,
( sk3 = X1
| tl(sk4) != X2
| hd(sk4) != X4
| app(X2,X3) != X1
| cons(X4,nil) != X3
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(cn,[status(thm)],[c_0_34]) ).
cnf(c_0_39,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_41,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_42,plain,
( ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_31]),c_0_31]) ).
cnf(c_0_43,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_44,negated_conjecture,
( app(tl(sk4),cons(hd(sk4),nil)) = sk3
| ~ neq(nil,sk4)
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil))
| ~ ssList(tl(sk4)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])])])])])]),c_0_40]) ).
cnf(c_0_45,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_46,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_41,c_0_36]) ).
cnf(c_0_47,plain,
( ssItem(X1)
| ~ ssItem(X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_49,negated_conjecture,
( app(tl(sk4),cons(hd(sk4),nil)) = sk3
| sk4 = nil
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil))
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_30]),c_0_46])]) ).
cnf(c_0_50,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
clause76 ).
cnf(c_0_51,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause97 ).
cnf(c_0_52,plain,
ssItem(X1),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause116 ).
cnf(c_0_54,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk2
| app(app(X3,cons(X1,nil)),X2) != sk1 ),
co1_8 ).
cnf(c_0_55,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_56,negated_conjecture,
( app(tl(sk4),cons(hd(sk4),nil)) = sk3
| sk4 = nil
| ~ ssList(cons(hd(sk4),nil))
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_46])]) ).
cnf(c_0_57,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
clause75 ).
cnf(c_0_58,plain,
( hd(cons(X1,X2)) = X1
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]) ).
cnf(c_0_59,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
clause101 ).
cnf(c_0_60,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_53]) ).
cnf(c_0_61,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != sk3
| app(app(X3,cons(X2,nil)),X1) != sk4
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55]),c_0_36]) ).
cnf(c_0_62,negated_conjecture,
( app(tl(sk4),cons(hd(sk4),nil)) = sk3
| sk4 = nil
| ~ ssList(cons(hd(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_46])]) ).
cnf(c_0_63,plain,
( skaf44(X1) = hd(X1)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_30])]) ).
cnf(c_0_64,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_31]),c_0_30])]) ).
cnf(c_0_65,negated_conjecture,
( app(app(X1,X2),X3) != sk3
| app(app(X3,X2),X1) != sk4
| ~ singletonP(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_59]),c_0_48])]) ).
cnf(c_0_66,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_67,negated_conjecture,
( app(tl(sk4),cons(hd(sk4),nil)) = sk3
| sk4 = nil
| ~ ssItem(hd(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_31]),c_0_30])]) ).
cnf(c_0_68,plain,
( cons(hd(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_63]) ).
cnf(c_0_69,plain,
singletonP(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_52])]) ).
cnf(c_0_70,negated_conjecture,
( app(app(nil,X1),X2) != sk4
| app(X2,X1) != sk3
| ~ singletonP(X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_30])]),c_0_40]) ).
cnf(c_0_71,negated_conjecture,
( app(tl(sk4),cons(hd(sk4),nil)) = sk3
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_50]),c_0_46])]) ).
cnf(c_0_72,plain,
( cons(hd(cons(X1,nil)),nil) = cons(X1,nil)
| ~ ssList(cons(X1,nil)) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_73,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_52])]) ).
cnf(c_0_74,negated_conjecture,
( sk4 = nil
| app(app(nil,cons(hd(sk4),nil)),tl(sk4)) != sk4
| ~ ssList(cons(hd(sk4),nil))
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_69])]) ).
cnf(c_0_75,plain,
cons(hd(cons(X1,nil)),nil) = cons(X1,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_30])]) ).
cnf(c_0_76,negated_conjecture,
( sk4 = nil
| app(cons(hd(sk4),nil),tl(sk4)) != sk4
| ~ ssList(cons(hd(sk4),nil))
| ~ ssList(tl(sk4)) ),
inference(spm,[status(thm)],[c_0_74,c_0_29]) ).
cnf(c_0_77,plain,
ssList(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_75]),c_0_30])]) ).
cnf(c_0_78,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause157 ).
cnf(c_0_79,negated_conjecture,
( sk4 = nil
| app(cons(hd(sk4),nil),tl(sk4)) != sk4
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_77])]) ).
cnf(c_0_80,plain,
( app(cons(X1,X2),X3) = cons(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_52])]) ).
cnf(c_0_81,negated_conjecture,
( sk4 = nil
| cons(hd(sk4),app(nil,tl(sk4))) != sk4
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_30])]) ).
cnf(c_0_82,negated_conjecture,
( sk4 = nil
| cons(hd(sk4),tl(sk4)) != sk4
| ~ ssList(tl(sk4)) ),
inference(spm,[status(thm)],[c_0_81,c_0_29]) ).
cnf(c_0_83,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause104 ).
cnf(c_0_84,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
clause117 ).
cnf(c_0_85,negated_conjecture,
( sk4 = nil
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_46])]) ).
cnf(c_0_86,plain,
( ~ neq(X1,X1)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_84]) ).
cnf(c_0_87,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_57]),c_0_46])]) ).
cnf(c_0_88,plain,
~ neq(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_52])]) ).
cnf(c_0_89,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_87]),c_0_88]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC418-1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n005.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 : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 01:38:31 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.REfKsuuLA8/E---3.1_25558.p
% 0.91/0.60 # Version: 3.1pre001
% 0.91/0.60 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.91/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.91/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.91/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.91/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.91/0.60 # Starting sh5l with 300s (1) cores
% 0.91/0.60 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 25635 completed with status 0
% 0.91/0.60 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.91/0.60 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.91/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.91/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.91/0.60 # No SInE strategy applied
% 0.91/0.60 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.91/0.60 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.91/0.60 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.91/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.91/0.60 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.91/0.60 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.91/0.60 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.91/0.60 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 25641 completed with status 0
% 0.91/0.60 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.91/0.60 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.91/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.91/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.91/0.60 # No SInE strategy applied
% 0.91/0.60 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.91/0.60 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.91/0.60 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.91/0.60 # Preprocessing time : 0.003 s
% 0.91/0.60 # Presaturation interreduction done
% 0.91/0.60
% 0.91/0.60 # Proof found!
% 0.91/0.60 # SZS status Unsatisfiable
% 0.91/0.60 # SZS output start CNFRefutation
% See solution above
% 0.91/0.60 # Parsed axioms : 195
% 0.91/0.60 # Removed by relevancy pruning/SinE : 0
% 0.91/0.60 # Initial clauses : 195
% 0.91/0.60 # Removed in clause preprocessing : 0
% 0.91/0.60 # Initial clauses in saturation : 195
% 0.91/0.60 # Processed clauses : 993
% 0.91/0.60 # ...of these trivial : 7
% 0.91/0.60 # ...subsumed : 228
% 0.91/0.60 # ...remaining for further processing : 758
% 0.91/0.60 # Other redundant clauses eliminated : 156
% 0.91/0.60 # Clauses deleted for lack of memory : 0
% 0.91/0.60 # Backward-subsumed : 110
% 0.91/0.60 # Backward-rewritten : 216
% 0.91/0.60 # Generated clauses : 2176
% 0.91/0.60 # ...of the previous two non-redundant : 1974
% 0.91/0.60 # ...aggressively subsumed : 0
% 0.91/0.60 # Contextual simplify-reflections : 21
% 0.91/0.60 # Paramodulations : 2016
% 0.91/0.60 # Factorizations : 0
% 0.91/0.60 # NegExts : 0
% 0.91/0.60 # Equation resolutions : 164
% 0.91/0.60 # Total rewrite steps : 1864
% 0.91/0.60 # Propositional unsat checks : 0
% 0.91/0.60 # Propositional check models : 0
% 0.91/0.60 # Propositional check unsatisfiable : 0
% 0.91/0.60 # Propositional clauses : 0
% 0.91/0.60 # Propositional clauses after purity: 0
% 0.91/0.60 # Propositional unsat core size : 0
% 0.91/0.60 # Propositional preprocessing time : 0.000
% 0.91/0.60 # Propositional encoding time : 0.000
% 0.91/0.60 # Propositional solver time : 0.000
% 0.91/0.60 # Success case prop preproc time : 0.000
% 0.91/0.60 # Success case prop encoding time : 0.000
% 0.91/0.60 # Success case prop solver time : 0.000
% 0.91/0.60 # Current number of processed clauses : 221
% 0.91/0.60 # Positive orientable unit clauses : 67
% 0.91/0.60 # Positive unorientable unit clauses: 0
% 0.91/0.60 # Negative unit clauses : 6
% 0.91/0.60 # Non-unit-clauses : 148
% 0.91/0.60 # Current number of unprocessed clauses: 1171
% 0.91/0.60 # ...number of literals in the above : 6552
% 0.91/0.60 # Current number of archived formulas : 0
% 0.91/0.60 # Current number of archived clauses : 513
% 0.91/0.60 # Clause-clause subsumption calls (NU) : 35835
% 0.91/0.60 # Rec. Clause-clause subsumption calls : 6518
% 0.91/0.60 # Non-unit clause-clause subsumptions : 316
% 0.91/0.60 # Unit Clause-clause subsumption calls : 440
% 0.91/0.60 # Rewrite failures with RHS unbound : 0
% 0.91/0.60 # BW rewrite match attempts : 44
% 0.91/0.60 # BW rewrite match successes : 36
% 0.91/0.60 # Condensation attempts : 0
% 0.91/0.60 # Condensation successes : 0
% 0.91/0.60 # Termbank termtop insertions : 46352
% 0.91/0.60
% 0.91/0.60 # -------------------------------------------------
% 0.91/0.60 # User time : 0.095 s
% 0.91/0.60 # System time : 0.010 s
% 0.91/0.60 # Total time : 0.105 s
% 0.91/0.60 # Maximum resident set size: 2120 pages
% 0.91/0.60
% 0.91/0.60 # -------------------------------------------------
% 0.91/0.60 # User time : 0.446 s
% 0.91/0.60 # System time : 0.029 s
% 0.91/0.60 # Total time : 0.474 s
% 0.91/0.60 # Maximum resident set size: 1852 pages
% 0.91/0.60 % E---3.1 exiting
%------------------------------------------------------------------------------