%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYO042^2 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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 : Wed Sep 30 08:43:40 AM UTC 2026
% Result : Theorem 0.10s 0.23s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 27 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 158 ( 1 equ; 0 cnn)
% Maximal formula atoms : 56 ( 5 avg)
% Number of connectives : 186 ( 57 ~; 48 |; 29 &; 42 @)
% ( 7 <=>; 0 =>; 0 <=; 3 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 5 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
g: $o > $o ).
thf(decl_24,type,
p: ( $o > $o ) > $o ).
thf(decl_25,type,
x: $o ).
thf(decl_26,type,
y: $o ).
thf(decl_27,type,
esk1_0: $o ).
thf(4,conjecture,
~ ( ( x
<~> y )
& ( ( g @ x )
<=> y )
& ( ( g @ y )
<=> x )
& ( p @ g )
& ~ ( p @ $not ) ),
file('/export/starexec/sandbox/tmp/tmp.n02aNhTnOc/E---3.1_2700732.p',4) ).
thf(c_0_1,negated_conjecture,
~ ~ ( ( x
<~> y )
& ( ( g @ x )
<=> y )
& ( ( g @ y )
<=> x )
& ( p @ g )
& ~ ( p @ $not ) ),
inference(assume_negation,[status(cth)],[4]) ).
thf(c_0_2,negated_conjecture,
~ ~ ( ~ ( x
<=> y )
& ( ( ( ~ x
| ( g @ $true ) )
& ( x
| ( g @ $false ) ) )
<=> y )
& ( ( ( ~ y
| ( g @ $true ) )
& ( y
| ( g @ $false ) ) )
<=> x )
& ( p @ g )
& ~ ( p @ $not ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[c_0_1])]) ).
thf(c_0_3,negated_conjecture,
( ( ~ x
| ~ y )
& ( x
| y )
& ( ~ x
| x
| y )
& ( ~ ( g @ $false )
| x
| y )
& ( ~ x
| ~ ( g @ $true )
| y )
& ( ~ ( g @ $false )
| ~ ( g @ $true )
| y )
& ( ~ x
| ( g @ $true )
| ~ y )
& ( x
| ( g @ $false )
| ~ y )
& ( ~ y
| y
| x )
& ( ~ ( g @ $false )
| y
| x )
& ( ~ y
| ~ ( g @ $true )
| x )
& ( ~ ( g @ $false )
| ~ ( g @ $true )
| x )
& ( ~ y
| ( g @ $true )
| ~ x )
& ( y
| ( g @ $false )
| ~ x )
& ( p @ g )
& ~ ( p @ $not ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
thf(c_0_4,negated_conjecture,
~ ( p @ $not ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
p @ g,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
( x
| ~ y
| ~ ( g @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
( x
| y ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_8,plain,
$not != g,
inference(ext_sup,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_9,negated_conjecture,
( y
| ~ x
| ~ ( g @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_10,negated_conjecture,
( x
| ~ ( g @ $true ) ),
inference(csr,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_11,plain,
( ~ esk1_0
<~> ( g @ esk1_0 ) ),
inference(neg_ext,[status(thm)],[c_0_8]) ).
thf(c_0_12,negated_conjecture,
( y
| ~ ( g @ $true ) ),
inference(csr,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_13,plain,
( ( g @ $true )
| ~ esk1_0 ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_11])]) ).
thf(c_0_14,negated_conjecture,
( x
| ( g @ ~ $true )
| ~ y ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_15,negated_conjecture,
( ~ x
| ~ y ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_16,plain,
( y
| ~ esk1_0 ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_17,plain,
( x
| ~ esk1_0 ),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
thf(c_0_18,plain,
( esk1_0
| ~ ( g @ ~ $true ) ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_11])]) ).
thf(c_0_19,negated_conjecture,
( ( g @ ~ $true )
| x ),
inference(csr,[status(thm)],[c_0_14,c_0_7]) ).
thf(c_0_20,negated_conjecture,
~ esk1_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
thf(c_0_21,negated_conjecture,
( y
| ( g @ ~ $true )
| ~ x ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_22,plain,
x,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
thf(c_0_23,negated_conjecture,
( ( g @ ~ $true )
| y ),
inference(csr,[status(thm)],[c_0_21,c_0_7]) ).
thf(c_0_24,negated_conjecture,
~ y,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_22])]) ).
thf(c_0_25,negated_conjecture,
g @ ~ $true,
inference(sr,[status(thm)],[c_0_23,c_0_24]) ).
thf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_25])]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO042^2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.16 % Computer : n003.cluster.edu
% 0.10/0.16 % Model : x86_64 x86_64
% 0.10/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16 % Memory : 8046.5625MB
% 0.10/0.16 % OS : Linux 6.8.0-71-generic
% 0.10/0.16 % CPULimit : 300
% 0.10/0.16 % WCLimit : 300
% 0.10/0.16 % DateTime : Tue Sep 29 16:26:13 UTC 2026
% 0.10/0.16 % CPUTime :
% 0.10/0.16 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.20 Running higher-order theorem proving
% 0.10/0.21 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.n02aNhTnOc/E---3.1_2700732.p
% 0.10/0.23 % Version: 3.5.1-ho
% 0.10/0.23 % Preprocessing class: HSSSSLSSSSSCSSN.
% 0.10/0.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.23 % Starting sh3 with 1500s (5) cores
% 0.10/0.23 % Starting sh5l with 300s (1) cores
% 0.10/0.23 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.23 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.23 % sh3 with pid 2700745 completed with status 0
% 0.10/0.23 % Result found by sh3
% 0.10/0.23 % Preprocessing class: HSSSSLSSSSSCSSN.
% 0.10/0.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.23 % Starting sh3 with 1500s (5) cores
% 0.10/0.23 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.23 % No SInE strategy applied
% 0.10/0.23 % Search class: HGHNF-FFSF00-SSSFFFNN
% 0.10/0.23 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.23 % Starting SubtermCWHack with 151s (1) cores
% 0.10/0.23 % Starting sh3 with 901s (1) cores
% 0.10/0.23 % Starting sh5l with 151s (1) cores
% 0.10/0.23 % Starting new_bool_3 with 151s (1) cores
% 0.10/0.23 % Starting new_bool_1 with 146s (1) cores
% 0.10/0.23 % SubtermCWHack with pid 2700751 completed with status 10
% 0.10/0.23 % new_bool_3 with pid 2700755 completed with status 0
% 0.10/0.23 % Result found by new_bool_3
% 0.10/0.23 % Preprocessing class: HSSSSLSSSSSCSSN.
% 0.10/0.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.23 % Starting sh3 with 1500s (5) cores
% 0.10/0.23 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.23 % No SInE strategy applied
% 0.10/0.23 % Search class: HGHNF-FFSF00-SSSFFFNN
% 0.10/0.23 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.23 % Starting SubtermCWHack with 151s (1) cores
% 0.10/0.23 % Starting sh3 with 901s (1) cores
% 0.10/0.23 % Starting sh5l with 151s (1) cores
% 0.10/0.23 % Starting new_bool_3 with 151s (1) cores
% 0.10/0.23 % Preprocessing time : 0.001 s
% 0.10/0.23 % Presaturation interreduction done
% 0.10/0.23
% 0.10/0.23 % Proof found!
% 0.10/0.23 % SZS status Theorem
% 0.10/0.23 % SZS output start CNFRefutation
% See solution above
% 0.10/0.23 % Parsed axioms : 5
% 0.10/0.23 % Removed by relevancy pruning/SinE : 0
% 0.10/0.23 % Initial clauses : 20
% 0.10/0.23 % Removed in clause preprocessing : 6
% 0.10/0.23 % Initial clauses in saturation : 14
% 0.10/0.23 % Processed clauses : 33
% 0.10/0.23 % ...of these trivial : 0
% 0.10/0.23 % ...subsumed : 7
% 0.10/0.23 % ...remaining for further processing : 26
% 0.10/0.23 % Other redundant clauses eliminated : 0
% 0.10/0.23 % Clauses deleted for lack of memory : 0
% 0.10/0.23 % Backward-subsumed : 3
% 0.10/0.23 % Backward-rewritten : 5
% 0.10/0.23 % Generated clauses : 21
% 0.10/0.23 % ...of the previous two non-redundant : 12
% 0.10/0.23 % ...aggressively subsumed : 0
% 0.10/0.23 % Contextual simplify-reflections : 5
% 0.10/0.23 % Paramodulations : 6
% 0.10/0.23 % Factorizations : 0
% 0.10/0.23 % NegExts : 1
% 0.10/0.23 % Equation resolutions : 0
% 0.10/0.23 % Disequality decompositions : 0
% 0.10/0.23 % Total rewrite steps : 5
% 0.10/0.23 % ...of those cached : 3
% 0.10/0.23 % Propositional unsat checks : 0
% 0.10/0.23 % Propositional check models : 0
% 0.10/0.23 % Propositional check unsatisfiable : 0
% 0.10/0.23 % Propositional clauses : 0
% 0.10/0.23 % Propositional clauses after purity: 0
% 0.10/0.23 % Propositional unsat core size : 0
% 0.10/0.23 % Propositional preprocessing time : 0.000
% 0.10/0.23 % Propositional encoding time : 0.000
% 0.10/0.23 % Propositional solver time : 0.000
% 0.10/0.23 % Success case prop preproc time : 0.000
% 0.10/0.23 % Success case prop encoding time : 0.000
% 0.10/0.23 % Success case prop solver time : 0.000
% 0.10/0.23 % Current number of processed clauses : 8
% 0.10/0.23 % Positive orientable unit clauses : 3
% 0.10/0.23 % Positive unorientable unit clauses: 0
% 0.10/0.23 % Negative unit clauses : 4
% 0.10/0.23 % Non-unit-clauses : 1
% 0.10/0.23 % Current number of unprocessed clauses: 0
% 0.10/0.23 % ...number of literals in the above : 0
% 0.10/0.23 % Current number of archived formulas : 0
% 0.10/0.23 % Current number of archived clauses : 18
% 0.10/0.23 % Clause-clause subsumption calls (NU) : 16
% 0.10/0.23 % Rec. Clause-clause subsumption calls : 16
% 0.10/0.23 % Non-unit clause-clause subsumptions : 12
% 0.10/0.23 % Unit Clause-clause subsumption calls : 8
% 0.10/0.23 % Rewrite failures with RHS unbound : 0
% 0.10/0.23 % BW rewrite match attempts : 2
% 0.10/0.23 % BW rewrite match successes : 2
% 0.10/0.23 % Condensation attempts : 0
% 0.10/0.23 % Condensation successes : 0
% 0.10/0.23 % Termbank termtop insertions : 1112
% 0.10/0.23 % Search garbage collected termcells : 101
% 0.10/0.23
% 0.10/0.23 % -------------------------------------------------
% 0.10/0.23 % User time : 0.004 s
% 0.10/0.23 % System time : 0.004 s
% 0.10/0.23 % Total time : 0.009 s
% 0.10/0.23 % Maximum resident set size: 3624 pages
% 0.10/0.23
% 0.10/0.23 % -------------------------------------------------
% 0.10/0.23 % User time : 0.009 s
% 0.10/0.23 % System time : 0.011 s
% 0.10/0.23 % Total time : 0.020 s
% 0.10/0.23 % Maximum resident set size: 4864 pages
% 0.10/0.23 % E exiting
%------------------------------------------------------------------------------