%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO499_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n014.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 03:46:41 PM UTC 2026
% Result : Theorem 0.11s 0.43s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 27 ( 5 unt; 0 def)
% Number of atoms : 431 ( 183 equ)
% Maximal formula atoms : 306 ( 15 avg)
% Number of connectives : 663 ( 259 ~; 300 |; 104 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 89 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 3 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 0 con; 1-1 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
tff(decl_23,type,
a: $o ).
tff(decl_24,type,
b: $o ).
tff(decl_25,type,
c: $o ).
tff(decl_26,type,
f: $o > $i ).
tff(decl_27,type,
f1: $o > $i ).
tff(decl_28,type,
f2: $o > $i ).
tff(decl_29,type,
g: $o > $i ).
tff(decl_30,type,
g1: $o > $i ).
tff(decl_31,type,
g2: $o > $i ).
fof(con,conjecture,
( f2(c) != g2(b)
| f2(b) = g2(c)
| f1(c) != g1(a)
| f1(a) = g1(c)
| f(b) != g(a)
| f(a) = g(b) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(c_0_1,negated_conjecture,
~ ( f2(c) != g2(b)
| f2(b) = g2(c)
| f1(c) != g1(a)
| f1(a) = g1(c)
| f(b) != g(a)
| f(a) = g(b) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_2,negated_conjecture,
~ ( ~ ( ( ( ( f2($false) = g2($false)
| b )
& ( f2($false) = g2($true)
| ~ b ) )
| c )
& ( ( ( f2($true) = g2($false)
| b )
& ( f2($true) = g2($true)
| ~ b ) )
| ~ c ) )
| ( ( ( ( f2($false) = g2($false)
| c )
& ( f2($false) = g2($true)
| ~ c ) )
| b )
& ( ( ( f2($true) = g2($false)
| c )
& ( f2($true) = g2($true)
| ~ c ) )
| ~ b ) )
| ~ ( ( ( ( f1($false) = g1($false)
| a )
& ( f1($false) = g1($true)
| ~ a ) )
| c )
& ( ( ( f1($true) = g1($false)
| a )
& ( f1($true) = g1($true)
| ~ a ) )
| ~ c ) )
| ( ( ( ( f1($false) = g1($false)
| c )
& ( f1($false) = g1($true)
| ~ c ) )
| a )
& ( ( ( f1($true) = g1($false)
| c )
& ( f1($true) = g1($true)
| ~ c ) )
| ~ a ) )
| ~ ( ( ( ( f($false) = g($false)
| a )
& ( f($false) = g($true)
| ~ a ) )
| b )
& ( ( ( f($true) = g($false)
| a )
& ( f($true) = g($true)
| ~ a ) )
| ~ b ) )
| ( ( ( ( f($false) = g($false)
| b )
& ( f($false) = g($true)
| ~ b ) )
| a )
& ( ( ( f($true) = g($false)
| b )
& ( f($true) = g($true)
| ~ b ) )
| ~ a ) ) ),
inference(fool_unroll,[status(thm)],[c_0_1]) ).
fof(c_0_3,negated_conjecture,
( ( c
| f2($false) = g2($false)
| b )
& ( c
| f2($false) = g2($true)
| ~ b )
& ( ~ c
| f2($true) = g2($false)
| b )
& ( ~ c
| f2($true) = g2($true)
| ~ b )
& ( f2($true) != g2($true)
| f2($true) != g2($false)
| f2($false) != g2($true)
| f2($false) != g2($false) )
& ( f2($true) != g2($true)
| f2($true) != g2($false)
| f2($false) != g2($true)
| ~ c )
& ( f2($true) != g2($true)
| f2($true) != g2($false)
| c
| f2($false) != g2($false) )
& ( f2($true) != g2($true)
| f2($true) != g2($false)
| c
| ~ c )
& ( f2($true) != g2($true)
| f2($true) != g2($false)
| ~ b )
& ( f2($true) != g2($true)
| ~ c
| f2($false) != g2($true)
| f2($false) != g2($false) )
& ( f2($true) != g2($true)
| ~ c
| f2($false) != g2($true)
| ~ c )
& ( f2($true) != g2($true)
| ~ c
| c
| f2($false) != g2($false) )
& ( f2($true) != g2($true)
| ~ c
| c
| ~ c )
& ( f2($true) != g2($true)
| ~ c
| ~ b )
& ( c
| f2($true) != g2($false)
| f2($false) != g2($true)
| f2($false) != g2($false) )
& ( c
| f2($true) != g2($false)
| f2($false) != g2($true)
| ~ c )
& ( c
| f2($true) != g2($false)
| c
| f2($false) != g2($false) )
& ( c
| f2($true) != g2($false)
| c
| ~ c )
& ( c
| f2($true) != g2($false)
| ~ b )
& ( c
| ~ c
| f2($false) != g2($true)
| f2($false) != g2($false) )
& ( c
| ~ c
| f2($false) != g2($true)
| ~ c )
& ( c
| ~ c
| c
| f2($false) != g2($false) )
& ( c
| ~ c
| c
| ~ c )
& ( c
| ~ c
| ~ b )
& ( b
| f2($false) != g2($true)
| f2($false) != g2($false) )
& ( b
| f2($false) != g2($true)
| ~ c )
& ( b
| c
| f2($false) != g2($false) )
& ( b
| c
| ~ c )
& ( b
| ~ b )
& ( c
| f1($false) = g1($false)
| a )
& ( c
| f1($false) = g1($true)
| ~ a )
& ( ~ c
| f1($true) = g1($false)
| a )
& ( ~ c
| f1($true) = g1($true)
| ~ a )
& ( f1($true) != g1($true)
| f1($true) != g1($false)
| f1($false) != g1($true)
| f1($false) != g1($false) )
& ( f1($true) != g1($true)
| f1($true) != g1($false)
| f1($false) != g1($true)
| ~ c )
& ( f1($true) != g1($true)
| f1($true) != g1($false)
| c
| f1($false) != g1($false) )
& ( f1($true) != g1($true)
| f1($true) != g1($false)
| c
| ~ c )
& ( f1($true) != g1($true)
| f1($true) != g1($false)
| ~ a )
& ( f1($true) != g1($true)
| ~ c
| f1($false) != g1($true)
| f1($false) != g1($false) )
& ( f1($true) != g1($true)
| ~ c
| f1($false) != g1($true)
| ~ c )
& ( f1($true) != g1($true)
| ~ c
| c
| f1($false) != g1($false) )
& ( f1($true) != g1($true)
| ~ c
| c
| ~ c )
& ( f1($true) != g1($true)
| ~ c
| ~ a )
& ( c
| f1($true) != g1($false)
| f1($false) != g1($true)
| f1($false) != g1($false) )
& ( c
| f1($true) != g1($false)
| f1($false) != g1($true)
| ~ c )
& ( c
| f1($true) != g1($false)
| c
| f1($false) != g1($false) )
& ( c
| f1($true) != g1($false)
| c
| ~ c )
& ( c
| f1($true) != g1($false)
| ~ a )
& ( c
| ~ c
| f1($false) != g1($true)
| f1($false) != g1($false) )
& ( c
| ~ c
| f1($false) != g1($true)
| ~ c )
& ( c
| ~ c
| c
| f1($false) != g1($false) )
& ( c
| ~ c
| c
| ~ c )
& ( c
| ~ c
| ~ a )
& ( a
| f1($false) != g1($true)
| f1($false) != g1($false) )
& ( a
| f1($false) != g1($true)
| ~ c )
& ( a
| c
| f1($false) != g1($false) )
& ( a
| c
| ~ c )
& ( a
| ~ a )
& ( b
| f($false) = g($false)
| a )
& ( b
| f($false) = g($true)
| ~ a )
& ( ~ b
| f($true) = g($false)
| a )
& ( ~ b
| f($true) = g($true)
| ~ a )
& ( f($true) != g($true)
| f($true) != g($false)
| f($false) != g($true)
| f($false) != g($false) )
& ( f($true) != g($true)
| f($true) != g($false)
| f($false) != g($true)
| ~ b )
& ( f($true) != g($true)
| f($true) != g($false)
| b
| f($false) != g($false) )
& ( f($true) != g($true)
| f($true) != g($false)
| b
| ~ b )
& ( f($true) != g($true)
| f($true) != g($false)
| ~ a )
& ( f($true) != g($true)
| ~ b
| f($false) != g($true)
| f($false) != g($false) )
& ( f($true) != g($true)
| ~ b
| f($false) != g($true)
| ~ b )
& ( f($true) != g($true)
| ~ b
| b
| f($false) != g($false) )
& ( f($true) != g($true)
| ~ b
| b
| ~ b )
& ( f($true) != g($true)
| ~ b
| ~ a )
& ( b
| f($true) != g($false)
| f($false) != g($true)
| f($false) != g($false) )
& ( b
| f($true) != g($false)
| f($false) != g($true)
| ~ b )
& ( b
| f($true) != g($false)
| b
| f($false) != g($false) )
& ( b
| f($true) != g($false)
| b
| ~ b )
& ( b
| f($true) != g($false)
| ~ a )
& ( b
| ~ b
| f($false) != g($true)
| f($false) != g($false) )
& ( b
| ~ b
| f($false) != g($true)
| ~ b )
& ( b
| ~ b
| b
| f($false) != g($false) )
& ( b
| ~ b
| b
| ~ b )
& ( b
| ~ b
| ~ a )
& ( a
| f($false) != g($true)
| f($false) != g($false) )
& ( a
| f($false) != g($true)
| ~ b )
& ( a
| b
| f($false) != g($false) )
& ( a
| b
| ~ b )
& ( a
| ~ a ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
cnf(c_0_4,negated_conjecture,
( f($true) != g($true)
| ~ b
| ~ a ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
( ~ b
| ~ a
| f($true) = g($true) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
( f1($false) != g1($false)
| a
| c ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,negated_conjecture,
( c
| f1($false) = g1($false)
| a ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
( f2($false) != g2($false)
| b
| c ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
( c
| f2($false) = g2($false)
| b ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,negated_conjecture,
( ~ a
| ~ b ),
inference(csr,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_11,negated_conjecture,
( a
| c ),
inference(csr,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_12,negated_conjecture,
( b
| c ),
inference(csr,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( ~ c
| ~ a
| f1($true) = g1($true) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,negated_conjecture,
c,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_15,negated_conjecture,
( f($false) != g($false)
| a
| b ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_16,negated_conjecture,
( b
| f($false) = g($false)
| a ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_17,negated_conjecture,
( f1($true) != g1($true)
| ~ c
| ~ a ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_18,negated_conjecture,
( ~ a
| f1($true) = g1($true) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_19,negated_conjecture,
( ~ c
| ~ b
| f2($true) = g2($true) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_20,negated_conjecture,
( a
| b ),
inference(csr,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
~ a,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_14])]),c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( ~ b
| f2($true) = g2($true) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_14])]) ).
cnf(c_0_23,negated_conjecture,
b,
inference(sr,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( f2($true) != g2($true)
| ~ c
| ~ b ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_25,negated_conjecture,
f2($true) = g2($true),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_23]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO499_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n014.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 11:52:50 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.11/0.43 % Version: 3.5.1
% 0.11/0.43 % Preprocessing class: FSSSSLSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43 % Starting sh5l with 300s (1) cores
% 0.11/0.43 % sh5l with pid 4000873 completed with status 0
% 0.11/0.43 % Result found by sh5l
% 0.11/0.43 % Preprocessing class: FSSSSLSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43 % Starting sh5l with 300s (1) cores
% 0.11/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.43 % Search class: FGHSF-FFMS11-SFFFFFNN
% 0.11/0.43 % partial match(1): FGHSF-FFMS31-SFFFFFNN
% 0.11/0.43 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.43 % SubtermCWHack with pid 4000874 completed with status 0
% 0.11/0.43 % Result found by SubtermCWHack
% 0.11/0.43 % Preprocessing class: FSSSSLSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43 % Starting sh5l with 300s (1) cores
% 0.11/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.43 % Search class: FGHSF-FFMS11-SFFFFFNN
% 0.11/0.43 % partial match(1): FGHSF-FFMS31-SFFFFFNN
% 0.11/0.43 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.43 % Preprocessing time : 0.002 s
% 0.11/0.43
% 0.11/0.43 % Proof found!
% 0.11/0.43 % SZS status Theorem
% 0.11/0.43 % SZS output start CNFRefutation
% See solution above
% 0.11/0.43 % Parsed axioms : 10
% 0.11/0.43 % Removed by relevancy pruning/SinE : 9
% 0.11/0.43 % Initial clauses : 87
% 0.11/0.43 % Removed in clause preprocessing : 36
% 0.11/0.43 % Initial clauses in saturation : 51
% 0.11/0.43 % Processed clauses : 33
% 0.11/0.43 % ...of these trivial : 0
% 0.11/0.43 % ...subsumed : 0
% 0.11/0.43 % ...remaining for further processing : 32
% 0.11/0.43 % Other redundant clauses eliminated : 0
% 0.11/0.43 % Clauses deleted for lack of memory : 0
% 0.11/0.43 % Backward-subsumed : 7
% 0.11/0.43 % Backward-rewritten : 15
% 0.11/0.43 % Generated clauses : 21
% 0.11/0.43 % ...of the previous two non-redundant : 9
% 0.11/0.43 % ...aggressively subsumed : 0
% 0.11/0.43 % Contextual simplify-reflections : 12
% 0.11/0.43 % Paramodulations : 19
% 0.11/0.43 % Factorizations : 0
% 0.11/0.43 % NegExts : 0
% 0.11/0.43 % Equation resolutions : 0
% 0.11/0.43 % Disequality decompositions : 0
% 0.11/0.43 % Total rewrite steps : 19
% 0.11/0.43 % ...of those cached : 16
% 0.11/0.43 % Propositional unsat checks : 0
% 0.11/0.43 % Propositional check models : 0
% 0.11/0.43 % Propositional check unsatisfiable : 0
% 0.11/0.43 % Propositional clauses : 0
% 0.11/0.43 % Propositional clauses after purity: 0
% 0.11/0.43 % Propositional unsat core size : 0
% 0.11/0.43 % Propositional preprocessing time : 0.000
% 0.11/0.43 % Propositional encoding time : 0.000
% 0.11/0.43 % Propositional solver time : 0.000
% 0.11/0.43 % Success case prop preproc time : 0.000
% 0.11/0.43 % Success case prop encoding time : 0.000
% 0.11/0.43 % Success case prop solver time : 0.000
% 0.11/0.43 % Current number of processed clauses : 8
% 0.11/0.43 % Positive orientable unit clauses : 5
% 0.11/0.43 % Positive unorientable unit clauses: 0
% 0.11/0.43 % Negative unit clauses : 1
% 0.11/0.43 % Non-unit-clauses : 2
% 0.11/0.43 % Current number of unprocessed clauses: 27
% 0.11/0.43 % ...number of literals in the above : 96
% 0.11/0.43 % Current number of archived formulas : 0
% 0.11/0.43 % Current number of archived clauses : 24
% 0.11/0.43 % Clause-clause subsumption calls (NU) : 33
% 0.11/0.43 % Rec. Clause-clause subsumption calls : 33
% 0.11/0.43 % Non-unit clause-clause subsumptions : 16
% 0.11/0.43 % Unit Clause-clause subsumption calls : 9
% 0.11/0.43 % Rewrite failures with RHS unbound : 0
% 0.11/0.43 % BW rewrite match attempts : 2
% 0.11/0.43 % BW rewrite match successes : 2
% 0.11/0.43 % Condensation attempts : 0
% 0.11/0.43 % Condensation successes : 0
% 0.11/0.43 % Termbank termtop insertions : 3119
% 0.11/0.43 % Search garbage collected termcells : 356
% 0.11/0.43
% 0.11/0.43 % -------------------------------------------------
% 0.11/0.43 % User time : 0.004 s
% 0.11/0.43 % System time : 0.002 s
% 0.11/0.43 % Total time : 0.006 s
% 0.11/0.43 % Maximum resident set size: 3628 pages
% 0.11/0.43
% 0.11/0.43 % -------------------------------------------------
% 0.11/0.43 % User time : 0.005 s
% 0.11/0.43 % System time : 0.007 s
% 0.11/0.43 % Total time : 0.012 s
% 0.11/0.43 % Maximum resident set size: 4608 pages
% 0.11/0.43 % E exiting
%------------------------------------------------------------------------------