TSTP Solution File: SWC022+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC022+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 : Tue May 21 04:27:00 EDT 2024
% Result : Theorem 0.21s 0.56s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 13
% Syntax : Number of formulae : 75 ( 12 unt; 0 def)
% Number of atoms : 281 ( 81 equ)
% Maximal formula atoms : 34 ( 3 avg)
% Number of connectives : 336 ( 130 ~; 132 |; 33 &)
% ( 3 <=>; 38 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 86 ( 0 sgn 53 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& frontsegP(X2,X5)
& frontsegP(X1,X5) )
| ? [X6] :
( ssList(X6)
& X3 != X6
& ? [X7] :
( ssItem(X7)
& cons(X7,nil) = X6
& hd(X4) = X7
& neq(nil,X4) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax42,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax42) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(ax45,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax45) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& frontsegP(X2,X5)
& frontsegP(X1,X5) )
| ? [X6] :
( ssList(X6)
& X3 != X6
& ? [X7] :
( ssItem(X7)
& cons(X7,nil) = X6
& hd(X4) = X7
& neq(nil,X4) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_14,negated_conjecture,
! [X12,X13,X14] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( neq(esk2_0,nil)
| neq(esk2_0,nil) )
& ( ~ neq(esk4_0,nil)
| neq(esk2_0,nil) )
& ( neq(esk2_0,nil)
| ~ ssList(X12)
| ~ neq(X12,nil)
| ~ frontsegP(esk2_0,X12)
| ~ frontsegP(esk1_0,X12) )
& ( ~ neq(esk4_0,nil)
| ~ ssList(X12)
| ~ neq(X12,nil)
| ~ frontsegP(esk2_0,X12)
| ~ frontsegP(esk1_0,X12) )
& ( neq(esk2_0,nil)
| ~ ssList(X13)
| esk3_0 = X13
| ~ ssItem(X14)
| cons(X14,nil) != X13
| hd(esk4_0) != X14
| ~ neq(nil,esk4_0) )
& ( ~ neq(esk4_0,nil)
| ~ ssList(X13)
| esk3_0 = X13
| ~ ssItem(X14)
| cons(X14,nil) != X13
| hd(esk4_0) != X14
| ~ neq(nil,esk4_0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])])]) ).
cnf(c_0_15,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_16,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_15]) ).
cnf(c_0_17,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_18,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_19,negated_conjecture,
( esk3_0 = X1
| ~ neq(esk4_0,nil)
| ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,nil) != X1
| hd(esk4_0) != X2
| ~ neq(nil,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_22,plain,
! [X17,X18] :
( ( ~ neq(X17,X18)
| X17 != X18
| ~ ssList(X18)
| ~ ssList(X17) )
& ( X17 = X18
| neq(X17,X18)
| ~ ssList(X18)
| ~ ssList(X17) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])]) ).
cnf(c_0_23,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_24,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax22]) ).
cnf(c_0_25,negated_conjecture,
( cons(hd(esk4_0),nil) = esk1_0
| ~ ssList(cons(hd(esk4_0),nil))
| ~ neq(nil,esk4_0)
| ~ ssItem(hd(esk4_0)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21])])])]) ).
cnf(c_0_26,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_23,c_0_17]) ).
cnf(c_0_28,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_29,plain,
! [X24] :
( ~ ssList(X24)
| nil = X24
| ssItem(hd(X24)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).
cnf(c_0_30,negated_conjecture,
( cons(hd(esk4_0),nil) = esk1_0
| esk4_0 = nil
| ~ ssList(cons(hd(esk4_0),nil))
| ~ ssItem(hd(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_31,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_32,plain,
! [X34,X35] :
( ~ ssList(X34)
| ~ ssItem(X35)
| ssList(cons(X35,X34)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_33,negated_conjecture,
( cons(hd(esk4_0),nil) = esk1_0
| esk4_0 = nil
| ~ ssList(cons(hd(esk4_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_27])]) ).
cnf(c_0_34,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_35,plain,
! [X45,X46] :
( ~ ssList(X45)
| ~ ssItem(X46)
| cons(X46,X45) = app(cons(X46,nil),X45) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_36,negated_conjecture,
( cons(hd(esk4_0),nil) = esk1_0
| esk4_0 = nil
| ~ ssItem(hd(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_28])]) ).
fof(c_0_37,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
inference(fof_simplification,[status(thm)],[ax78]) ).
cnf(c_0_38,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( cons(hd(esk4_0),nil) = esk1_0
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_31]),c_0_27])]) ).
fof(c_0_40,plain,
! [X31] :
( ~ ssList(X31)
| nil = X31
| cons(hd(X31),tl(X31)) = X31 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_37])])]) ).
cnf(c_0_41,negated_conjecture,
( cons(hd(esk4_0),X1) = app(esk1_0,X1)
| esk4_0 = nil
| ~ ssList(X1)
| ~ ssItem(hd(esk4_0)) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
fof(c_0_42,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
fof(c_0_43,plain,
! [X49,X50,X52] :
( ( ssList(esk10_2(X49,X50))
| ~ frontsegP(X49,X50)
| ~ ssList(X50)
| ~ ssList(X49) )
& ( app(X50,esk10_2(X49,X50)) = X49
| ~ frontsegP(X49,X50)
| ~ ssList(X50)
| ~ ssList(X49) )
& ( ~ ssList(X52)
| app(X50,X52) != X49
| frontsegP(X49,X50)
| ~ ssList(X50)
| ~ ssList(X49) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax5])])])])])]) ).
fof(c_0_44,plain,
! [X75,X76] :
( ~ ssList(X75)
| ~ ssList(X76)
| ssList(app(X75,X76)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_45,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( cons(hd(esk4_0),X1) = app(esk1_0,X1)
| esk4_0 = nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_31]),c_0_27])]) ).
fof(c_0_47,plain,
! [X68] :
( ~ ssList(X68)
| nil = X68
| ssList(tl(X68)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_42])])]) ).
cnf(c_0_48,plain,
( frontsegP(X3,X2)
| ~ ssList(X1)
| app(X2,X1) != X3
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_49,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_50,negated_conjecture,
( app(esk1_0,tl(esk4_0)) = esk4_0
| esk4_0 = nil
| ~ ssList(tl(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_27])]) ).
cnf(c_0_51,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_52,negated_conjecture,
( ~ neq(esk4_0,nil)
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(esk2_0,X1)
| ~ frontsegP(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_53,plain,
! [X58] :
( ~ ssList(X58)
| frontsegP(X58,X58) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax42])])]) ).
cnf(c_0_54,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_48]),c_0_49]) ).
cnf(c_0_55,negated_conjecture,
( app(esk1_0,tl(esk4_0)) = esk4_0
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_27])]) ).
cnf(c_0_56,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_57,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
inference(fof_simplification,[status(thm)],[ax18]) ).
cnf(c_0_58,negated_conjecture,
( ~ frontsegP(esk1_0,X1)
| ~ frontsegP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_17]),c_0_21])]) ).
cnf(c_0_59,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_60,negated_conjecture,
( esk4_0 = nil
| frontsegP(esk4_0,esk1_0)
| ~ ssList(tl(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56])]) ).
fof(c_0_61,plain,
! [X36,X37] :
( ~ ssList(X36)
| ~ ssItem(X37)
| cons(X37,X36) != X36 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_57])])])]) ).
cnf(c_0_62,negated_conjecture,
( ~ frontsegP(esk4_0,esk1_0)
| ~ neq(esk1_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_56])]) ).
cnf(c_0_63,negated_conjecture,
( esk4_0 = nil
| frontsegP(esk4_0,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_51]),c_0_27])]) ).
cnf(c_0_64,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_65,negated_conjecture,
( esk4_0 = nil
| ~ neq(esk1_0,nil) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
fof(c_0_66,plain,
! [X66] :
( ~ ssList(X66)
| frontsegP(X66,nil) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])])]) ).
cnf(c_0_67,negated_conjecture,
( esk4_0 = nil
| esk1_0 != nil
| ~ ssItem(hd(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_39]),c_0_28])]) ).
cnf(c_0_68,negated_conjecture,
( esk1_0 = nil
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_26]),c_0_28]),c_0_56])]) ).
cnf(c_0_69,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_70,negated_conjecture,
( esk4_0 = nil
| ~ ssItem(hd(esk4_0)) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_71,negated_conjecture,
( ~ frontsegP(esk4_0,nil)
| ~ neq(nil,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_69]),c_0_28]),c_0_56])]) ).
cnf(c_0_72,negated_conjecture,
esk4_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_31]),c_0_27])]) ).
cnf(c_0_73,negated_conjecture,
~ neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_69]),c_0_27])]) ).
cnf(c_0_74,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_72]),c_0_73]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC022+1 : TPTP v8.2.0. Released v2.4.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n007.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 03:14:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/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/benchmark/theBenchmark.p
% 0.21/0.56 # Version: 3.1.0
% 0.21/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.56 # Starting sh5l with 300s (1) cores
% 0.21/0.56 # new_bool_3 with pid 4485 completed with status 0
% 0.21/0.56 # Result found by new_bool_3
% 0.21/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.56 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.21/0.56 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.21/0.56 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 4488 completed with status 0
% 0.21/0.56 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.21/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.56 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.21/0.56 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.21/0.56 # Preprocessing time : 0.002 s
% 0.21/0.56 # Presaturation interreduction done
% 0.21/0.56
% 0.21/0.56 # Proof found!
% 0.21/0.56 # SZS status Theorem
% 0.21/0.56 # SZS output start CNFRefutation
% See solution above
% 0.21/0.56 # Parsed axioms : 96
% 0.21/0.56 # Removed by relevancy pruning/SinE : 59
% 0.21/0.56 # Initial clauses : 64
% 0.21/0.56 # Removed in clause preprocessing : 0
% 0.21/0.56 # Initial clauses in saturation : 64
% 0.21/0.56 # Processed clauses : 615
% 0.21/0.56 # ...of these trivial : 5
% 0.21/0.56 # ...subsumed : 320
% 0.21/0.56 # ...remaining for further processing : 290
% 0.21/0.56 # Other redundant clauses eliminated : 34
% 0.21/0.56 # Clauses deleted for lack of memory : 0
% 0.21/0.56 # Backward-subsumed : 77
% 0.21/0.56 # Backward-rewritten : 48
% 0.21/0.56 # Generated clauses : 1357
% 0.21/0.56 # ...of the previous two non-redundant : 1199
% 0.21/0.56 # ...aggressively subsumed : 0
% 0.21/0.56 # Contextual simplify-reflections : 62
% 0.21/0.56 # Paramodulations : 1320
% 0.21/0.56 # Factorizations : 0
% 0.21/0.56 # NegExts : 0
% 0.21/0.56 # Equation resolutions : 39
% 0.21/0.56 # Disequality decompositions : 0
% 0.21/0.56 # Total rewrite steps : 731
% 0.21/0.56 # ...of those cached : 720
% 0.21/0.56 # Propositional unsat checks : 0
% 0.21/0.56 # Propositional check models : 0
% 0.21/0.56 # Propositional check unsatisfiable : 0
% 0.21/0.56 # Propositional clauses : 0
% 0.21/0.56 # Propositional clauses after purity: 0
% 0.21/0.56 # Propositional unsat core size : 0
% 0.21/0.56 # Propositional preprocessing time : 0.000
% 0.21/0.56 # Propositional encoding time : 0.000
% 0.21/0.56 # Propositional solver time : 0.000
% 0.21/0.56 # Success case prop preproc time : 0.000
% 0.21/0.56 # Success case prop encoding time : 0.000
% 0.21/0.56 # Success case prop solver time : 0.000
% 0.21/0.56 # Current number of processed clauses : 99
% 0.21/0.56 # Positive orientable unit clauses : 9
% 0.21/0.56 # Positive unorientable unit clauses: 0
% 0.21/0.56 # Negative unit clauses : 2
% 0.21/0.56 # Non-unit-clauses : 88
% 0.21/0.56 # Current number of unprocessed clauses: 682
% 0.21/0.56 # ...number of literals in the above : 3986
% 0.21/0.56 # Current number of archived formulas : 0
% 0.21/0.56 # Current number of archived clauses : 184
% 0.21/0.56 # Clause-clause subsumption calls (NU) : 7190
% 0.21/0.56 # Rec. Clause-clause subsumption calls : 2119
% 0.21/0.56 # Non-unit clause-clause subsumptions : 458
% 0.21/0.56 # Unit Clause-clause subsumption calls : 53
% 0.21/0.56 # Rewrite failures with RHS unbound : 0
% 0.21/0.56 # BW rewrite match attempts : 2
% 0.21/0.56 # BW rewrite match successes : 2
% 0.21/0.56 # Condensation attempts : 0
% 0.21/0.56 # Condensation successes : 0
% 0.21/0.56 # Termbank termtop insertions : 27558
% 0.21/0.56 # Search garbage collected termcells : 1795
% 0.21/0.56
% 0.21/0.56 # -------------------------------------------------
% 0.21/0.56 # User time : 0.056 s
% 0.21/0.56 # System time : 0.002 s
% 0.21/0.56 # Total time : 0.058 s
% 0.21/0.56 # Maximum resident set size: 1928 pages
% 0.21/0.56
% 0.21/0.56 # -------------------------------------------------
% 0.21/0.56 # User time : 0.059 s
% 0.21/0.56 # System time : 0.005 s
% 0.21/0.56 # Total time : 0.063 s
% 0.21/0.56 # Maximum resident set size: 1820 pages
% 0.21/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------