TSTP Solution File: SYO527^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO527^1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:47:57 EDT 2024
% Result : Theorem 0.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of formulae : 13 ( 8 unt; 5 typ; 0 def)
% Number of atoms : 8 ( 0 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 27 ( 3 ~; 0 |; 0 &; 24 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 5 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 10 ( 0 ^ 7 !; 3 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_sort2,type,
b: $tType ).
thf(decl_22,type,
r: a > b > $o ).
thf(decl_23,type,
esk1_1: a > b ).
thf(decl_24,type,
esk2_1: ( a > b ) > a ).
thf(skolem,conjecture,
? [X3: a > b] :
! [X1: a] : ( r @ X1 @ ( X3 @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',skolem) ).
thf(rtotal,axiom,
! [X1: a] :
? [X2: b] : ( r @ X1 @ X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rtotal) ).
thf(c_0_2,negated_conjecture,
~ ? [X3: a > b] :
! [X1: a] : ( r @ X1 @ ( X3 @ X1 ) ),
inference(assume_negation,[status(cth)],[skolem]) ).
thf(c_0_3,negated_conjecture,
! [X10: a > b] :
~ ( r @ ( esk2_1 @ X10 ) @ ( X10 @ ( esk2_1 @ X10 ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
thf(c_0_4,plain,
! [X8: a] : ( r @ X8 @ ( esk1_1 @ X8 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rtotal])]) ).
thf(c_0_5,negated_conjecture,
! [X3: a > b] :
~ ( r @ ( esk2_1 @ X3 ) @ ( X3 @ ( esk2_1 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,plain,
! [X1: a] : ( r @ X1 @ ( esk1_1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_5,c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYO527^1 : TPTP v8.2.0. Released v5.2.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.12/0.35 % Computer : n007.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Mon May 20 10:23:08 EDT 2024
% 0.12/0.35 % CPUTime :
% 0.20/0.52 Running higher-order theorem proving
% 0.20/0.52 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.53 # Version: 3.1.0-ho
% 0.20/0.53 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.20/0.53 # Starting post_as_ho10 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_9 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # post_as_ho10 with pid 5427 completed with status 0
% 0.20/0.53 # Result found by post_as_ho10
% 0.20/0.53 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.20/0.53 # Starting post_as_ho10 with 300s (1) cores
% 0.20/0.53 # No SInE strategy applied
% 0.20/0.53 # Search class: HUUNF-FFSF11-SSSFFFNN
% 0.20/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.53 # new_ho_10 with pid 5431 completed with status 0
% 0.20/0.53 # Result found by new_ho_10
% 0.20/0.53 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.20/0.53 # Starting post_as_ho10 with 300s (1) cores
% 0.20/0.53 # No SInE strategy applied
% 0.20/0.53 # Search class: HUUNF-FFSF11-SSSFFFNN
% 0.20/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.53 # Preprocessing time : 0.001 s
% 0.20/0.53 # Presaturation interreduction done
% 0.20/0.53
% 0.20/0.53 # Proof found!
% 0.20/0.53 # SZS status Theorem
% 0.20/0.53 # SZS output start CNFRefutation
% See solution above
% 0.20/0.53 # Parsed axioms : 5
% 0.20/0.53 # Removed by relevancy pruning/SinE : 0
% 0.20/0.53 # Initial clauses : 5
% 0.20/0.53 # Removed in clause preprocessing : 3
% 0.20/0.53 # Initial clauses in saturation : 2
% 0.20/0.53 # Processed clauses : 4
% 0.20/0.53 # ...of these trivial : 0
% 0.20/0.53 # ...subsumed : 0
% 0.20/0.53 # ...remaining for further processing : 4
% 0.20/0.53 # Other redundant clauses eliminated : 0
% 0.20/0.53 # Clauses deleted for lack of memory : 0
% 0.20/0.53 # Backward-subsumed : 0
% 0.20/0.53 # Backward-rewritten : 0
% 0.20/0.53 # Generated clauses : 1
% 0.20/0.53 # ...of the previous two non-redundant : 0
% 0.20/0.53 # ...aggressively subsumed : 0
% 0.20/0.53 # Contextual simplify-reflections : 0
% 0.20/0.53 # Paramodulations : 1
% 0.20/0.53 # Factorizations : 0
% 0.20/0.53 # NegExts : 0
% 0.20/0.53 # Equation resolutions : 0
% 0.20/0.53 # Disequality decompositions : 0
% 0.20/0.53 # Total rewrite steps : 0
% 0.20/0.53 # ...of those cached : 0
% 0.20/0.53 # Propositional unsat checks : 0
% 0.20/0.53 # Propositional check models : 0
% 0.20/0.53 # Propositional check unsatisfiable : 0
% 0.20/0.53 # Propositional clauses : 0
% 0.20/0.53 # Propositional clauses after purity: 0
% 0.20/0.53 # Propositional unsat core size : 0
% 0.20/0.53 # Propositional preprocessing time : 0.000
% 0.20/0.53 # Propositional encoding time : 0.000
% 0.20/0.53 # Propositional solver time : 0.000
% 0.20/0.53 # Success case prop preproc time : 0.000
% 0.20/0.53 # Success case prop encoding time : 0.000
% 0.20/0.53 # Success case prop solver time : 0.000
% 0.20/0.53 # Current number of processed clauses : 2
% 0.20/0.53 # Positive orientable unit clauses : 1
% 0.20/0.53 # Positive unorientable unit clauses: 0
% 0.20/0.53 # Negative unit clauses : 1
% 0.20/0.53 # Non-unit-clauses : 0
% 0.20/0.53 # Current number of unprocessed clauses: 0
% 0.20/0.53 # ...number of literals in the above : 0
% 0.20/0.53 # Current number of archived formulas : 0
% 0.20/0.53 # Current number of archived clauses : 2
% 0.20/0.53 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.53 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.53 # Non-unit clause-clause subsumptions : 0
% 0.20/0.53 # Unit Clause-clause subsumption calls : 0
% 0.20/0.53 # Rewrite failures with RHS unbound : 0
% 0.20/0.53 # BW rewrite match attempts : 0
% 0.20/0.53 # BW rewrite match successes : 0
% 0.20/0.53 # Condensation attempts : 4
% 0.20/0.53 # Condensation successes : 0
% 0.20/0.53 # Termbank termtop insertions : 160
% 0.20/0.53 # Search garbage collected termcells : 31
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.003 s
% 0.20/0.53 # System time : 0.001 s
% 0.20/0.53 # Total time : 0.004 s
% 0.20/0.53 # Maximum resident set size: 1576 pages
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.005 s
% 0.20/0.53 # System time : 0.003 s
% 0.20/0.53 # Total time : 0.007 s
% 0.20/0.53 # Maximum resident set size: 1720 pages
% 0.20/0.53 % E---3.1 exiting
% 0.20/0.53 % E exiting
%------------------------------------------------------------------------------