%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO503^1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:17 AM UTC 2026
% Result : Theorem 0.09s 0.27s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 1
% Syntax : Number of formulae : 28 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 150 ( 1 equ; 0 cnn)
% Maximal formula atoms : 32 ( 5 avg)
% Number of connectives : 175 ( 55 ~; 51 |; 15 &; 50 @)
% ( 3 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
a: $o ).
thf(decl_24,type,
b: $o ).
thf(decl_26,type,
f: $o > $o ).
thf(decl_27,type,
g: $o > $o ).
thf(decl_28,type,
p: ( $o > $o ) > $o ).
thf(decl_29,type,
esk1_0: $o ).
thf(claim,conjecture,
( ( a
<=> b )
| ~ ( f @ a )
| ~ ( f @ b )
| ~ ( g @ a )
| ~ ( g @ b )
| ~ ( p @ f )
| ( p @ g ) ),
file('/export/starexec/sandbox2/tmp/tmp.ssGU6PtewG/E---3.1_376389.p',claim) ).
thf(c_0_1,negated_conjecture,
~ ( ( a
<=> b )
| ~ ( f @ a )
| ~ ( f @ b )
| ~ ( g @ a )
| ~ ( g @ b )
| ~ ( p @ f )
| ( p @ g ) ),
inference(assume_negation,[status(cth)],[claim]) ).
thf(c_0_2,negated_conjecture,
~ ( ( a
<=> b )
| ~ ( ( ~ a
| ( f @ $true ) )
& ( a
| ( f @ $false ) ) )
| ~ ( ( ~ b
| ( f @ $true ) )
& ( b
| ( f @ $false ) ) )
| ~ ( ( ~ a
| ( g @ $true ) )
& ( a
| ( g @ $false ) ) )
| ~ ( ( ~ b
| ( g @ $true ) )
& ( b
| ( g @ $false ) ) )
| ~ ( p @ f )
| ( p @ g ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[c_0_1])]) ).
thf(c_0_3,negated_conjecture,
( ( ~ a
| ~ b )
& ( a
| b )
& ( ~ a
| ( f @ $true ) )
& ( a
| ( f @ $false ) )
& ( ~ b
| ( f @ $true ) )
& ( b
| ( f @ $false ) )
& ( ~ a
| ( g @ $true ) )
& ( a
| ( g @ $false ) )
& ( ~ b
| ( g @ $true ) )
& ( b
| ( g @ $false ) )
& ( p @ f )
& ~ ( p @ g ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).
thf(c_0_4,negated_conjecture,
~ ( p @ g ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
p @ f,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,plain,
g != f,
inference(ext_sup,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_7,plain,
( ( g @ esk1_0 )
<~> ( f @ esk1_0 ) ),
inference(neg_ext,[status(thm)],[c_0_6]) ).
thf(c_0_8,plain,
( ~ ( f @ $true )
| ~ ( g @ $true )
| ~ esk1_0 ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_7])]) ).
thf(c_0_9,negated_conjecture,
( ( g @ $true )
| ~ b ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_10,negated_conjecture,
( ( f @ $true )
| ~ b ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_11,negated_conjecture,
( ( g @ $true )
| ~ a ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_12,negated_conjecture,
( ( f @ $true )
| ~ a ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_13,plain,
( ~ esk1_0
| ~ b ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
thf(c_0_14,negated_conjecture,
( a
| b ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_15,plain,
( ~ esk1_0
| ~ a ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_11]),c_0_12]) ).
thf(c_0_16,negated_conjecture,
~ esk1_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
thf(c_0_17,plain,
( ~ ( f @ ~ $true )
| ~ ( g @ ~ $true ) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_7])]),c_0_16]) ).
thf(c_0_18,negated_conjecture,
( a
| ( g @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_19,negated_conjecture,
( a
| ( f @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_20,negated_conjecture,
( ~ a
| ~ b ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_21,negated_conjecture,
a,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
thf(c_0_22,negated_conjecture,
( b
| ( f @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_23,negated_conjecture,
~ b,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
thf(c_0_24,negated_conjecture,
( b
| ( g @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_25,negated_conjecture,
f @ ~ $true,
inference(sr,[status(thm)],[c_0_22,c_0_23]) ).
thf(c_0_26,negated_conjecture,
g @ ~ $true,
inference(sr,[status(thm)],[c_0_24,c_0_23]) ).
thf(c_0_27,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_25])]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO503^1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n011.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 17:11:31 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.09/0.25 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.ssGU6PtewG/E---3.1_376389.p
% 0.09/0.27 % Version: 3.5.1-ho
% 0.09/0.27 % Preprocessing class: HSSSSLSSSSSCSSN.
% 0.09/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.27 % Starting sh3 with 1500s (5) cores
% 0.09/0.27 % Starting sh5l with 300s (1) cores
% 0.09/0.27 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.27 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.27 % sh3 with pid 376422 completed with status 0
% 0.09/0.27 % Result found by sh3
% 0.09/0.27 % Preprocessing class: HSSSSLSSSSSCSSN.
% 0.09/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.27 % Starting sh3 with 1500s (5) cores
% 0.09/0.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.27 % No SInE strategy applied
% 0.09/0.27 % Search class: HGHNF-FFSM00-SSSFFFNN
% 0.09/0.27 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.27 % Starting SubtermCWHack with 151s (1) cores
% 0.09/0.27 % Starting sh3 with 901s (1) cores
% 0.09/0.27 % Starting sh5l with 151s (1) cores
% 0.09/0.27 % Starting new_bool_3 with 151s (1) cores
% 0.09/0.27 % Starting new_bool_1 with 146s (1) cores
% 0.09/0.27 % SubtermCWHack with pid 376426 completed with status 10
% 0.09/0.27 % new_bool_3 with pid 376429 completed with status 0
% 0.09/0.27 % Result found by new_bool_3
% 0.09/0.27 % Preprocessing class: HSSSSLSSSSSCSSN.
% 0.09/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.27 % Starting sh3 with 1500s (5) cores
% 0.09/0.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.27 % No SInE strategy applied
% 0.09/0.27 % Search class: HGHNF-FFSM00-SSSFFFNN
% 0.09/0.27 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.27 % Starting SubtermCWHack with 151s (1) cores
% 0.09/0.27 % Starting sh3 with 901s (1) cores
% 0.09/0.27 % Starting sh5l with 151s (1) cores
% 0.09/0.27 % Starting new_bool_3 with 151s (1) cores
% 0.09/0.27 % Preprocessing time : 0.001 s
% 0.09/0.27 % Presaturation interreduction done
% 0.09/0.27
% 0.09/0.27 % Proof found!
% 0.09/0.27 % SZS status Theorem
% 0.09/0.27 % SZS output start CNFRefutation
% See solution above
% 0.09/0.27 % Parsed axioms : 7
% 0.09/0.27 % Removed by relevancy pruning/SinE : 0
% 0.09/0.27 % Initial clauses : 18
% 0.09/0.27 % Removed in clause preprocessing : 6
% 0.09/0.27 % Initial clauses in saturation : 12
% 0.09/0.27 % Processed clauses : 41
% 0.09/0.27 % ...of these trivial : 1
% 0.09/0.27 % ...subsumed : 0
% 0.09/0.27 % ...remaining for further processing : 39
% 0.09/0.27 % Other redundant clauses eliminated : 0
% 0.09/0.27 % Clauses deleted for lack of memory : 0
% 0.09/0.27 % Backward-subsumed : 6
% 0.09/0.27 % Backward-rewritten : 7
% 0.09/0.27 % Generated clauses : 46
% 0.09/0.27 % ...of the previous two non-redundant : 25
% 0.09/0.27 % ...aggressively subsumed : 0
% 0.09/0.27 % Contextual simplify-reflections : 4
% 0.09/0.27 % Paramodulations : 7
% 0.09/0.27 % Factorizations : 0
% 0.09/0.27 % NegExts : 1
% 0.09/0.27 % Equation resolutions : 0
% 0.09/0.27 % Disequality decompositions : 0
% 0.09/0.27 % Total rewrite steps : 9
% 0.09/0.27 % ...of those cached : 6
% 0.09/0.27 % Propositional unsat checks : 0
% 0.09/0.27 % Propositional check models : 0
% 0.09/0.27 % Propositional check unsatisfiable : 0
% 0.09/0.27 % Propositional clauses : 0
% 0.09/0.27 % Propositional clauses after purity: 0
% 0.09/0.27 % Propositional unsat core size : 0
% 0.09/0.27 % Propositional preprocessing time : 0.000
% 0.09/0.27 % Propositional encoding time : 0.000
% 0.09/0.27 % Propositional solver time : 0.000
% 0.09/0.27 % Success case prop preproc time : 0.000
% 0.09/0.27 % Success case prop encoding time : 0.000
% 0.09/0.27 % Success case prop solver time : 0.000
% 0.09/0.27 % Current number of processed clauses : 10
% 0.09/0.27 % Positive orientable unit clauses : 6
% 0.09/0.27 % Positive unorientable unit clauses: 0
% 0.09/0.27 % Negative unit clauses : 4
% 0.09/0.27 % Non-unit-clauses : 0
% 0.09/0.27 % Current number of unprocessed clauses: 8
% 0.09/0.27 % ...number of literals in the above : 28
% 0.09/0.27 % Current number of archived formulas : 0
% 0.09/0.27 % Current number of archived clauses : 29
% 0.09/0.27 % Clause-clause subsumption calls (NU) : 6
% 0.09/0.27 % Rec. Clause-clause subsumption calls : 6
% 0.09/0.27 % Non-unit clause-clause subsumptions : 4
% 0.09/0.27 % Unit Clause-clause subsumption calls : 13
% 0.09/0.27 % Rewrite failures with RHS unbound : 0
% 0.09/0.27 % BW rewrite match attempts : 2
% 0.09/0.27 % BW rewrite match successes : 2
% 0.09/0.27 % Condensation attempts : 0
% 0.09/0.27 % Condensation successes : 0
% 0.09/0.27 % Termbank termtop insertions : 1330
% 0.09/0.27 % Search garbage collected termcells : 52
% 0.09/0.27
% 0.09/0.27 % -------------------------------------------------
% 0.09/0.27 % User time : 0.002 s
% 0.09/0.27 % System time : 0.005 s
% 0.09/0.27 % Total time : 0.007 s
% 0.09/0.27 % Maximum resident set size: 3884 pages
% 0.09/0.27
% 0.09/0.27 % -------------------------------------------------
% 0.09/0.27 % User time : 0.011 s
% 0.09/0.27 % System time : 0.012 s
% 0.09/0.27 % Total time : 0.024 s
% 0.09/0.27 % Maximum resident set size: 4864 pages
% 0.09/0.27 % E exiting
%------------------------------------------------------------------------------