TSTP Solution File: SYO235^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO235^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 08:45:13 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 3 unt; 2 typ; 0 def)
% Number of atoms : 50 ( 0 equ; 0 cnn)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 71 ( 17 ~; 24 |; 3 &; 18 @)
% ( 5 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 2 usr; 4 con; 0-0 aty)
% Number of variables : 8 ( 0 ^ 8 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
cB: $o ).
thf(decl_23,type,
cA: $o ).
thf(cTHM505,conjecture,
( ( ! [X1: $o > $o] :
( ( X1 @ cA )
=> ( X1 @ cB ) )
| ( cA
<=> cB ) )
=> ( cA
<=> cB ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM505) ).
thf(c_0_1,negated_conjecture,
~ ( ( ! [X1: $o > $o] :
( ( X1 @ cA )
=> ( X1 @ cB ) )
| ( cA
<=> cB ) )
=> ( cA
<=> cB ) ),
inference(assume_negation,[status(cth)],[cTHM505]) ).
thf(c_0_2,negated_conjecture,
! [X3: $o > $o] :
( ( ~ cA
| cB
| ~ ( X3 @ cA )
| ( X3 @ cB ) )
& ( ~ cB
| cA
| ~ ( X3 @ cA )
| ( X3 @ cB ) )
& ( ~ cA
| ~ cB )
& ( cA
| cB ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X1: $o > $o] :
( cA
| ( X1 @ cB )
| ~ cB
| ~ ( X1 @ cA ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( cA
| cB ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X1: $o > $o] :
( ( X1 @ cB )
| cA
| ~ ( X1 @ cA ) ),
inference(csr,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_6,negated_conjecture,
( ( cB
<=> cA )
| cA ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_5]) ).
thf(c_0_7,negated_conjecture,
! [X1: $o > $o] :
( cB
| ( X1 @ cB )
| ~ cA
| ~ ( X1 @ cA ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
( ~ cA
| ~ cB ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
cA,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_6])]),c_0_4]) ).
thf(c_0_10,negated_conjecture,
! [X1: $o > $o] :
( ( X1 @ cB )
| cB
| ~ ( X1 @ cA ) ),
inference(csr,[status(thm)],[c_0_7,c_0_4]) ).
thf(c_0_11,negated_conjecture,
~ cB,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).
thf(c_0_12,negated_conjecture,
! [X1: $o > $o] :
( ( X1 @ cB )
| ~ ( X1 @ $true ) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_9]),c_0_11]) ).
thf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_12]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO235^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 10:13:52 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 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/benchmark/theBenchmark.p
% 0.20/0.49 # Version: 3.1.0-ho
% 0.20/0.49 # Preprocessing class: HSSSSLSSSSSNSSA.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.49 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # ho_unfolding_3 with pid 13551 completed with status 0
% 0.20/0.49 # Result found by ho_unfolding_3
% 0.20/0.49 # Preprocessing class: HSSSSLSSSSSNSSA.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HGHNF-FFSF00-SSSFFMBN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting post_as_ho12 with 811s (1) cores
% 0.20/0.49 # Starting ho_unfolding_3 with 151s (1) cores
% 0.20/0.49 # Starting sh2lt with 136s (1) cores
% 0.20/0.49 # Starting sh2l with 136s (1) cores
% 0.20/0.49 # Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.20/0.49 # ho_unfolding_3 with pid 13559 completed with status 0
% 0.20/0.49 # Result found by ho_unfolding_3
% 0.20/0.49 # Preprocessing class: HSSSSLSSSSSNSSA.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HGHNF-FFSF00-SSSFFMBN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting post_as_ho12 with 811s (1) cores
% 0.20/0.49 # Starting ho_unfolding_3 with 151s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 3
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 6
% 0.20/0.49 # Removed in clause preprocessing : 2
% 0.20/0.49 # Initial clauses in saturation : 4
% 0.20/0.49 # Processed clauses : 12
% 0.20/0.49 # ...of these trivial : 1
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 11
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 3
% 0.20/0.49 # Generated clauses : 7
% 0.20/0.49 # ...of the previous two non-redundant : 4
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 3
% 0.20/0.49 # Paramodulations : 1
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 7
% 0.20/0.49 # ...of those cached : 6
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 3
% 0.20/0.49 # Positive orientable unit clauses : 1
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 1
% 0.20/0.49 # Non-unit-clauses : 1
% 0.20/0.49 # Current number of unprocessed clauses: 0
% 0.20/0.49 # ...number of literals in the above : 0
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 8
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 13
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 10
% 0.20/0.49 # Non-unit clause-clause subsumptions : 3
% 0.20/0.49 # Unit Clause-clause subsumption calls : 0
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 1
% 0.20/0.49 # BW rewrite match successes : 1
% 0.20/0.49 # Condensation attempts : 13
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 609
% 0.20/0.49 # Search garbage collected termcells : 94
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.003 s
% 0.20/0.49 # System time : 0.002 s
% 0.20/0.49 # Total time : 0.006 s
% 0.20/0.49 # Maximum resident set size: 1716 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.009 s
% 0.20/0.49 # System time : 0.010 s
% 0.20/0.49 # Total time : 0.019 s
% 0.20/0.49 # Maximum resident set size: 1700 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------