%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ALG226+3 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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 12:01:43 PM UTC 2026
% Result : Theorem 29.70s 6.30s
% Output : CNFRefutation 29.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 13 unt; 0 def)
% Number of atoms : 79 ( 21 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 80 ( 26 ~; 16 |; 20 &)
% ( 1 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t7_closure3,conjecture,
! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2] :
( ( m1_pboole(X2,X1)
& v2_relat_1(X2) )
=> ! [X3] :
( ( m1_pboole(X3,X1)
& v2_relat_1(X3) )
=> ( ( k7_relat_1(X2,k1_closure3(X1,X2)) = k7_relat_1(X3,k1_closure3(X1,X3))
& k1_closure3(X1,X2) = k1_closure3(X1,X3) )
=> r6_pboole(X1,X2,X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_closure3) ).
fof(t6_closure3,axiom,
! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2] :
( ( m1_pboole(X2,X1)
& v2_relat_1(X2) )
=> X2 = k1_funct_4(k1_pboole(X1),k7_relat_1(X2,k1_closure3(X1,X2))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_closure3) ).
fof(redefinition_r6_pboole,axiom,
! [X1,X2,X3] :
( ( m1_pboole(X3,X1)
& m1_pboole(X2,X1) )
=> ( r6_pboole(X1,X2,X3)
<=> X2 = X3 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+80.ax',redefinition_r6_pboole) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2] :
( ( m1_pboole(X2,X1)
& v2_relat_1(X2) )
=> ! [X3] :
( ( m1_pboole(X3,X1)
& v2_relat_1(X3) )
=> ( ( k7_relat_1(X2,k1_closure3(X1,X2)) = k7_relat_1(X3,k1_closure3(X1,X3))
& k1_closure3(X1,X2) = k1_closure3(X1,X3) )
=> r6_pboole(X1,X2,X3) ) ) ) ),
inference(assume_negation,[status(cth)],[t7_closure3]) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2] :
( ( m1_pboole(X2,X1)
& v2_relat_1(X2) )
=> ! [X3] :
( ( m1_pboole(X3,X1)
& v2_relat_1(X3) )
=> ( ( k7_relat_1(X2,k1_closure3(X1,X2)) = k7_relat_1(X3,k1_closure3(X1,X3))
& k1_closure3(X1,X2) = k1_closure3(X1,X3) )
=> r6_pboole(X1,X2,X3) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_5,plain,
! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2] :
( ( m1_pboole(X2,X1)
& v2_relat_1(X2) )
=> X2 = k1_funct_4(k1_pboole(X1),k7_relat_1(X2,k1_closure3(X1,X2))) ) ),
inference(fof_simplification,[status(thm)],[t6_closure3]) ).
fof(c_0_6,negated_conjecture,
( ~ r6_pboole(esk1_0,esk2_0,esk3_0)
& k7_relat_1(esk2_0,k1_closure3(esk1_0,esk2_0)) = k7_relat_1(esk3_0,k1_closure3(esk1_0,esk3_0))
& k1_closure3(esk1_0,esk2_0) = k1_closure3(esk1_0,esk3_0)
& m1_pboole(esk3_0,esk1_0)
& v2_relat_1(esk3_0)
& m1_pboole(esk2_0,esk1_0)
& v2_relat_1(esk2_0)
& ~ v1_xboole_0(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_7,plain,
! [X191,X192] :
( X192 = k1_funct_4(k1_pboole(X191),k7_relat_1(X192,k1_closure3(X191,X192)))
| ~ m1_pboole(X192,X191)
| ~ v2_relat_1(X192)
| v1_xboole_0(X191) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
cnf(c_0_8,negated_conjecture,
k7_relat_1(esk2_0,k1_closure3(esk1_0,esk2_0)) = k7_relat_1(esk3_0,k1_closure3(esk1_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
k1_closure3(esk1_0,esk2_0) = k1_closure3(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ m1_pboole(X2,X1)
| ~ v2_relat_1(X2)
| X2 = k1_funct_4(k1_pboole(X1),k7_relat_1(X2,k1_closure3(X1,X2)))
| v1_xboole_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
k7_relat_1(esk3_0,k1_closure3(esk1_0,esk2_0)) = k7_relat_1(esk2_0,k1_closure3(esk1_0,esk2_0)),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
m1_pboole(esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
v2_relat_1(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
~ v1_xboole_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
k1_funct_4(k1_pboole(esk1_0),k7_relat_1(esk2_0,k1_closure3(esk1_0,esk2_0))) = esk3_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_9]),c_0_11]),c_0_12]),c_0_13])]),c_0_14]) ).
cnf(c_0_16,negated_conjecture,
m1_pboole(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
v2_relat_1(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_18,plain,
! [X27,X28,X29] :
( ( ~ m1_pboole(X29,X27)
| ~ m1_pboole(X28,X27)
| r6_pboole(X27,X28,X29)
| X28 != X29 )
& ( ~ m1_pboole(X29,X27)
| ~ m1_pboole(X28,X27)
| X28 = X29
| ~ r6_pboole(X27,X28,X29) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r6_pboole])])])]) ).
cnf(c_0_19,negated_conjecture,
~ r6_pboole(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,negated_conjecture,
esk3_0 = esk2_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_15]),c_0_16]),c_0_17])]),c_0_14]) ).
cnf(c_0_21,plain,
( ~ m1_pboole(X2,X3)
| ~ m1_pboole(X1,X3)
| X1 != X2
| r6_pboole(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
~ r6_pboole(esk1_0,esk2_0,esk2_0),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( ~ m1_pboole(X2,X1)
| r6_pboole(X1,X2,X2) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : ALG226+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.43 % Computer : n017.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Mon Sep 21 13:01:59 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.50 Running first-order theorem proving
% 0.17/0.50 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
% 29.70/6.30 % Version: 3.5.1
% 29.70/6.30 % Preprocessing class: FMLLSMLLSSSNFFN.
% 29.70/6.30 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 29.70/6.30 % Starting new_bool_3 with 897s (3) cores
% 29.70/6.30 % Starting new_bool_1 with 897s (3) cores
% 29.70/6.30 % Starting sh5l with 299s (1) cores
% 29.70/6.30 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 299s (1) cores
% 29.70/6.30 % new_bool_3 with pid 2372330 completed with status 0
% 29.70/6.30 % Result found by new_bool_3
% 29.70/6.30 % Preprocessing class: FMLLSMLLSSSNFFN.
% 29.70/6.30 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 29.70/6.30 % Starting new_bool_3 with 897s (3) cores
% 29.70/6.30 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 29.70/6.30 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 29.70/6.30 % Search class: FGHSM-SMLM32-MFFFFFNN
% 29.70/6.30 % Scheduled 13 strats onto 3 cores with 897 seconds (897 total)
% 29.70/6.30 % Starting SubtermCWHack with 81s (1) cores
% 29.70/6.30 % Starting new_bool_3 with 90s (1) cores
% 29.70/6.30 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 29.70/6.30 % C12_02_nc_SAT001_MinMin_p005000_rr with pid 2372337 completed with status 0
% 29.70/6.30 % Result found by C12_02_nc_SAT001_MinMin_p005000_rr
% 29.70/6.30 % Preprocessing class: FMLLSMLLSSSNFFN.
% 29.70/6.30 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 29.70/6.30 % Starting new_bool_3 with 897s (3) cores
% 29.70/6.30 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 29.70/6.30 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 29.70/6.30 % Search class: FGHSM-SMLM32-MFFFFFNN
% 29.70/6.30 % Scheduled 13 strats onto 3 cores with 897 seconds (897 total)
% 29.70/6.30 % Starting SubtermCWHack with 81s (1) cores
% 29.70/6.30 % Starting new_bool_3 with 90s (1) cores
% 29.70/6.30 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 29.70/6.30 % Preprocessing time : 0.057 s
% 29.70/6.30 % Presaturation interreduction done
% 29.70/6.30
% 29.70/6.30 % Proof found!
% 29.70/6.30 % SZS status Theorem
% 29.70/6.30 % SZS output start CNFRefutation
% See solution above
% 29.70/6.30 % Parsed axioms : 16951
% 29.70/6.30 % Removed by relevancy pruning/SinE : 15614
% 29.70/6.30 % Initial clauses : 2593
% 29.70/6.30 % Removed in clause preprocessing : 45
% 29.70/6.30 % Initial clauses in saturation : 2548
% 29.70/6.30 % Processed clauses : 19692
% 29.70/6.30 % ...of these trivial : 216
% 29.70/6.30 % ...subsumed : 12523
% 29.70/6.30 % ...remaining for further processing : 6953
% 29.70/6.30 % Other redundant clauses eliminated : 660
% 29.70/6.30 % Clauses deleted for lack of memory : 0
% 29.70/6.30 % Backward-subsumed : 242
% 29.70/6.30 % Backward-rewritten : 365
% 29.70/6.30 % Generated clauses : 91016
% 29.70/6.30 % ...of the previous two non-redundant : 79137
% 29.70/6.30 % ...aggressively subsumed : 0
% 29.70/6.30 % Contextual simplify-reflections : 148
% 29.70/6.30 % Paramodulations : 90326
% 29.70/6.30 % Factorizations : 10
% 29.70/6.30 % NegExts : 0
% 29.70/6.30 % Equation resolutions : 682
% 29.70/6.30 % Disequality decompositions : 0
% 29.70/6.30 % Total rewrite steps : 43335
% 29.70/6.30 % ...of those cached : 40264
% 29.70/6.30 % Propositional unsat checks : 1
% 29.70/6.30 % Propositional check models : 1
% 29.70/6.30 % Propositional check unsatisfiable : 0
% 29.70/6.30 % Propositional clauses : 0
% 29.70/6.30 % Propositional clauses after purity: 0
% 29.70/6.30 % Propositional unsat core size : 0
% 29.70/6.30 % Propositional preprocessing time : 0.000
% 29.70/6.30 % Propositional encoding time : 0.039
% 29.70/6.30 % Propositional solver time : 0.025
% 29.70/6.30 % Success case prop preproc time : 0.000
% 29.70/6.30 % Success case prop encoding time : 0.000
% 29.70/6.30 % Success case prop solver time : 0.000
% 29.70/6.30 % Current number of processed clauses : 3796
% 29.70/6.30 % Positive orientable unit clauses : 524
% 29.70/6.30 % Positive unorientable unit clauses: 3
% 29.70/6.30 % Negative unit clauses : 727
% 29.70/6.30 % Non-unit-clauses : 2542
% 29.70/6.30 % Current number of unprocessed clauses: 63195
% 29.70/6.30 % ...number of literals in the above : 235869
% 29.70/6.30 % Current number of archived formulas : 0
% 29.70/6.30 % Current number of archived clauses : 2954
% 29.70/6.30 % Clause-clause subsumption calls (NU) : 6109676
% 29.70/6.30 % Rec. Clause-clause subsumption calls : 1888463
% 29.70/6.30 % Non-unit clause-clause subsumptions : 4528
% 29.70/6.30 % Unit Clause-clause subsumption calls : 370856
% 29.70/6.30 % Rewrite failures with RHS unbound : 12
% 29.70/6.30 % BW rewrite match attempts : 382
% 29.70/6.30 % BW rewrite match successes : 297
% 29.70/6.30 % Condensation attempts : 0
% 29.70/6.30 % Condensation successes : 0
% 29.70/6.30 % Termbank termtop insertions : 1829397
% 29.70/6.30 % Search garbage collected termcells : 189439
% 29.70/6.30
% 29.70/6.30 % -------------------------------------------------
% 29.70/6.30 % User time : 4.124 s
% 29.70/6.30 % System time : 0.158 s
% 29.70/6.30 % Total time : 4.282 s
% 29.70/6.30 % Maximum resident set size: 36856 pages
% 29.70/6.30
% 29.70/6.30 % -------------------------------------------------
% 29.70/6.30 % User time : 12.859 s
% 29.70/6.30 % System time : 0.504 s
% 29.70/6.30 % Total time : 13.363 s
% 29.70/6.30 % Maximum resident set size: 28672 pages
% 29.70/6.30 % E exiting
%------------------------------------------------------------------------------