%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET171+4 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:13:48 PM UTC 2026
% Result : Theorem 1.89s 0.66s
% Output : CNFRefutation 1.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of formulae : 52 ( 13 unt; 0 def)
% Number of atoms : 124 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 135 ( 63 ~; 57 |; 10 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 54 ( 4 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thI11,conjecture,
! [X1,X2,X6] : equal_set(union(X1,intersection(X2,X6)),intersection(union(X1,X2),union(X1,X6))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI11) ).
fof(equal_set,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X2,X1)
& subset(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',equal_set) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',subset) ).
fof(intersection,axiom,
! [X3,X1,X2] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X2)
& member(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',intersection) ).
fof(union,axiom,
! [X3,X1,X2] :
( member(X3,union(X1,X2))
<=> ( member(X3,X2)
| member(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',union) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X6] : equal_set(union(X1,intersection(X2,X6)),intersection(union(X1,X2),union(X1,X6))),
inference(assume_negation,[status(cth)],[thI11]) ).
fof(c_0_6,negated_conjecture,
~ equal_set(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_7,plain,
! [X13,X14] :
( ( equal_set(X13,X14)
| ~ subset(X14,X13)
| ~ subset(X13,X14) )
& ( ~ equal_set(X13,X14)
| subset(X14,X13) )
& ( ~ equal_set(X13,X14)
| subset(X13,X14) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])])]) ).
cnf(c_0_8,negated_conjecture,
~ equal_set(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| equal_set(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X7,X8,X9,X10,X11] :
( ( subset(X10,X11)
| ~ member(esk1_2(X10,X11),X11) )
& ( subset(X10,X11)
| member(esk1_2(X10,X11),X10) )
& ( member(X9,X8)
| ~ member(X9,X7)
| ~ subset(X7,X8) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[subset])])])])])])]) ).
cnf(c_0_11,negated_conjecture,
( ~ subset(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)))
| ~ subset(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( ~ member(esk1_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( ~ subset(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0)))
| ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_14,plain,
! [X17,X18,X19] :
( ( member(X17,intersection(X18,X19))
| ~ member(X17,X19)
| ~ member(X17,X18) )
& ( ~ member(X17,intersection(X18,X19))
| member(X17,X19) )
& ( ~ member(X17,intersection(X18,X19))
| member(X17,X18) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection])])])]) ).
cnf(c_0_15,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( ~ member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),union(esk4_0,intersection(esk5_0,esk6_0)))
| ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))) ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_17,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_18,plain,
! [X20,X21,X22] :
( ( member(X20,union(X21,X22))
| ~ member(X20,X22) )
& ( member(X20,union(X21,X22))
| ~ member(X20,X21) )
& ( member(X20,X22)
| member(X20,X21)
| ~ member(X20,union(X21,X22)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union])])])]) ).
cnf(c_0_19,negated_conjecture,
( ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)))
| member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))) ),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( ~ subset(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0)))
| member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),union(esk4_0,intersection(esk5_0,esk6_0))) ),
inference(spm,[status(thm)],[c_0_11,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
( ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),union(esk4_0,esk5_0))
| ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),union(esk4_0,esk6_0))
| ~ member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),union(esk4_0,intersection(esk5_0,esk6_0))) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( ~ member(X1,X2)
| member(X1,union(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),union(esk4_0,esk5_0))
| ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),union(esk4_0,esk6_0))
| member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))) ),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_24,plain,
( ~ member(X1,X2)
| member(X1,union(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( ~ member(X1,union(X2,X3))
| member(X1,X3)
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,negated_conjecture,
( ~ member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),union(esk4_0,intersection(esk5_0,esk6_0)))
| member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),union(esk4_0,intersection(esk5_0,esk6_0))) ),
inference(spm,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_27,negated_conjecture,
( ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),esk4_0)
| ~ member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),union(esk4_0,intersection(esk5_0,esk6_0))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_22]) ).
cnf(c_0_28,negated_conjecture,
( member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),union(esk4_0,intersection(esk5_0,esk6_0)))
| member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))) ),
inference(spm,[status(thm)],[c_0_20,c_0_15]) ).
cnf(c_0_29,negated_conjecture,
( ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),esk4_0)
| member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_22]),c_0_22]) ).
cnf(c_0_30,negated_conjecture,
( ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),esk6_0)
| ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),union(esk4_0,esk5_0))
| ~ member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),union(esk4_0,intersection(esk5_0,esk6_0))) ),
inference(spm,[status(thm)],[c_0_21,c_0_24]) ).
cnf(c_0_31,plain,
( ~ member(X1,intersection(X3,X2))
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_32,negated_conjecture,
( ~ member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),union(esk4_0,intersection(esk5_0,esk6_0)))
| member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),intersection(esk5_0,esk6_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_33,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_34,negated_conjecture,
( ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),esk6_0)
| ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),union(esk4_0,esk5_0))
| member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_35,negated_conjecture,
( member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),intersection(esk5_0,esk6_0))
| member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_28]),c_0_29]) ).
cnf(c_0_36,negated_conjecture,
( ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),esk5_0)
| ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),esk6_0)
| ~ member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),union(esk4_0,intersection(esk5_0,esk6_0))) ),
inference(spm,[status(thm)],[c_0_30,c_0_24]) ).
cnf(c_0_37,negated_conjecture,
( ~ member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),union(esk4_0,intersection(esk5_0,esk6_0)))
| member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),esk6_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
( ~ member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),union(esk4_0,intersection(esk5_0,esk6_0)))
| member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),esk5_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
( ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),esk5_0)
| ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),esk6_0)
| member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))) ),
inference(spm,[status(thm)],[c_0_34,c_0_24]) ).
cnf(c_0_40,negated_conjecture,
( member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),esk6_0)
| member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))) ),
inference(spm,[status(thm)],[c_0_31,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
( member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),esk5_0)
| member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))) ),
inference(spm,[status(thm)],[c_0_33,c_0_35]) ).
cnf(c_0_42,negated_conjecture,
~ member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),union(esk4_0,intersection(esk5_0,esk6_0))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_43,negated_conjecture,
member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_44,negated_conjecture,
~ member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),intersection(esk5_0,esk6_0)),
inference(spm,[status(thm)],[c_0_42,c_0_24]) ).
cnf(c_0_45,negated_conjecture,
member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),union(esk4_0,esk5_0)),
inference(spm,[status(thm)],[c_0_33,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
~ member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),esk4_0),
inference(spm,[status(thm)],[c_0_42,c_0_22]) ).
cnf(c_0_47,negated_conjecture,
( ~ member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),esk5_0)
| ~ member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),esk6_0) ),
inference(spm,[status(thm)],[c_0_44,c_0_17]) ).
cnf(c_0_48,negated_conjecture,
member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),esk5_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_45]),c_0_46]) ).
cnf(c_0_49,negated_conjecture,
member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),union(esk4_0,esk6_0)),
inference(spm,[status(thm)],[c_0_31,c_0_43]) ).
cnf(c_0_50,negated_conjecture,
~ member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_49]),c_0_50]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET171+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n020.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 04:58:47 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.89/0.66 % Version: 3.5.1
% 1.89/0.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.89/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.89/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.89/0.66 % Starting new_bool_3 with 300s (1) cores
% 1.89/0.66 % Starting new_bool_1 with 300s (1) cores
% 1.89/0.66 % Starting sh5l with 300s (1) cores
% 1.89/0.66 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2055002 completed with status 0
% 1.89/0.66 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.89/0.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.89/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.89/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.89/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.89/0.66 % No SInE strategy applied
% 1.89/0.66 % Search class: FGHSF-FFMF21-SFFFFFNN
% 1.89/0.66 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.89/0.66 % Starting SubtermCWHack with 136s (1) cores
% 1.89/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.89/0.66 % Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.89/0.66 % Starting new_bool_3 with 136s (1) cores
% 1.89/0.66 % Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S033N with 136s (1) cores
% 1.89/0.66 % G-E--_208_B00_00_F1_SE_CS_SP_PS_S033N with pid 2055010 completed with status 0
% 1.89/0.66 % Result found by G-E--_208_B00_00_F1_SE_CS_SP_PS_S033N
% 1.89/0.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.89/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.89/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.89/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.89/0.66 % No SInE strategy applied
% 1.89/0.66 % Search class: FGHSF-FFMF21-SFFFFFNN
% 1.89/0.66 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.89/0.66 % Starting SubtermCWHack with 136s (1) cores
% 1.89/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.89/0.66 % Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.89/0.66 % Starting new_bool_3 with 136s (1) cores
% 1.89/0.66 % Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S033N with 136s (1) cores
% 1.89/0.66 % Preprocessing time : 0.001 s
% 1.89/0.66 % Presaturation interreduction done
% 1.89/0.66
% 1.89/0.66 % Proof found!
% 1.89/0.66 % SZS status Theorem
% 1.89/0.66 % SZS output start CNFRefutation
% See solution above
% 1.89/0.66 % Parsed axioms : 12
% 1.89/0.66 % Removed by relevancy pruning/SinE : 0
% 1.89/0.66 % Initial clauses : 30
% 1.89/0.66 % Removed in clause preprocessing : 0
% 1.89/0.66 % Initial clauses in saturation : 30
% 1.89/0.66 % Processed clauses : 983
% 1.89/0.66 % ...of these trivial : 64
% 1.89/0.66 % ...subsumed : 447
% 1.89/0.66 % ...remaining for further processing : 472
% 1.89/0.66 % Other redundant clauses eliminated : 5
% 1.89/0.66 % Clauses deleted for lack of memory : 0
% 1.89/0.66 % Backward-subsumed : 12
% 1.89/0.66 % Backward-rewritten : 12
% 1.89/0.66 % Generated clauses : 13902
% 1.89/0.66 % ...of the previous two non-redundant : 7418
% 1.89/0.66 % ...aggressively subsumed : 0
% 1.89/0.66 % Contextual simplify-reflections : 6
% 1.89/0.66 % Paramodulations : 13879
% 1.89/0.66 % Factorizations : 18
% 1.89/0.66 % NegExts : 0
% 1.89/0.66 % Equation resolutions : 5
% 1.89/0.66 % Disequality decompositions : 0
% 1.89/0.66 % Total rewrite steps : 6547
% 1.89/0.66 % ...of those cached : 6010
% 1.89/0.66 % Propositional unsat checks : 0
% 1.89/0.66 % Propositional check models : 0
% 1.89/0.66 % Propositional check unsatisfiable : 0
% 1.89/0.66 % Propositional clauses : 0
% 1.89/0.66 % Propositional clauses after purity: 0
% 1.89/0.66 % Propositional unsat core size : 0
% 1.89/0.66 % Propositional preprocessing time : 0.000
% 1.89/0.66 % Propositional encoding time : 0.000
% 1.89/0.66 % Propositional solver time : 0.000
% 1.89/0.66 % Success case prop preproc time : 0.000
% 1.89/0.66 % Success case prop encoding time : 0.000
% 1.89/0.66 % Success case prop solver time : 0.000
% 1.89/0.66 % Current number of processed clauses : 415
% 1.89/0.66 % Positive orientable unit clauses : 162
% 1.89/0.66 % Positive unorientable unit clauses: 0
% 1.89/0.66 % Negative unit clauses : 6
% 1.89/0.66 % Non-unit-clauses : 247
% 1.89/0.66 % Current number of unprocessed clauses: 6483
% 1.89/0.66 % ...number of literals in the above : 12279
% 1.89/0.66 % Current number of archived formulas : 0
% 1.89/0.66 % Current number of archived clauses : 54
% 1.89/0.66 % Clause-clause subsumption calls (NU) : 26932
% 1.89/0.66 % Rec. Clause-clause subsumption calls : 21182
% 1.89/0.66 % Non-unit clause-clause subsumptions : 448
% 1.89/0.66 % Unit Clause-clause subsumption calls : 697
% 1.89/0.66 % Rewrite failures with RHS unbound : 0
% 1.89/0.66 % BW rewrite match attempts : 349
% 1.89/0.66 % BW rewrite match successes : 2
% 1.89/0.66 % Condensation attempts : 0
% 1.89/0.66 % Condensation successes : 0
% 1.89/0.66 % Termbank termtop insertions : 154370
% 1.89/0.66 % Search garbage collected termcells : 453
% 1.89/0.66
% 1.89/0.66 % -------------------------------------------------
% 1.89/0.66 % User time : 0.145 s
% 1.89/0.66 % System time : 0.012 s
% 1.89/0.66 % Total time : 0.158 s
% 1.89/0.66 % Maximum resident set size: 3596 pages
% 1.89/0.66
% 1.89/0.66 % -------------------------------------------------
% 1.89/0.66 % User time : 0.953 s
% 1.89/0.66 % System time : 0.084 s
% 1.89/0.66 % Total time : 1.037 s
% 1.89/0.66 % Maximum resident set size: 4864 pages
% 1.89/0.66 % E exiting
%------------------------------------------------------------------------------