TSTP Solution File: SYO552^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO552^1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:48:02 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 7 ( 5 unt; 2 typ; 0 def)
% Number of atoms : 5 ( 4 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 17 ( 3 ~; 0 |; 0 &; 14 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 8 ( 0 ^ 6 !; 2 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
esk1_1: ( $i > $i > $i ) > $i ).
thf(decl_23,type,
esk2_1: ( $i > $i > $i ) > $i ).
thf(claim,conjecture,
? [X1: $i > $i > $i] :
! [X2: $i,X3: $i] :
( ( X1 @ X2 @ X3 )
= X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',claim) ).
thf(c_0_1,negated_conjecture,
~ ? [X1: $i > $i > $i] :
! [X2: $i,X3: $i] :
( ( X1 @ X2 @ X3 )
= X2 ),
inference(assume_negation,[status(cth)],[claim]) ).
thf(c_0_2,negated_conjecture,
! [X7: $i > $i > $i] :
( ( X7 @ ( esk1_1 @ X7 ) @ ( esk2_1 @ X7 ) )
!= ( esk1_1 @ X7 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).
thf(c_0_3,negated_conjecture,
! [X1: $i > $i > $i] :
( ( X1 @ ( esk1_1 @ X1 ) @ ( esk2_1 @ X1 ) )
!= ( esk1_1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
$false,
inference(er,[status(thm)],[c_0_3]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO552^1 : TPTP v8.2.0. Released v5.2.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n006.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 10:20:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 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/benchmark/theBenchmark.p
% 0.20/0.49 # Version: 3.1.0-ho
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.20/0.49 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_9 with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho4 with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho2 with 300s (1) cores
% 0.20/0.49 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.49 # Starting full_lambda_10 with 300s (1) cores
% 0.20/0.49 # Starting new_ho_8 with 300s (1) cores
% 0.20/0.49 # post_as_ho12 with pid 20284 completed with status 0
% 0.20/0.49 # Result found by post_as_ho12
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.20/0.49 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HUUPF-FFSF11-SSSFFMNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting post_as_ho12 with 181s (1) cores
% 0.20/0.49 # post_as_ho12 with pid 20292 completed with status 0
% 0.20/0.49 # Result found by post_as_ho12
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.20/0.49 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HUUPF-FFSF11-SSSFFMNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting post_as_ho12 with 181s (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 : 1
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 1
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 1
% 0.20/0.49 # Processed clauses : 2
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 2
% 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 : 0
% 0.20/0.49 # Generated clauses : 1
% 0.20/0.49 # ...of the previous two non-redundant : 0
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 0
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 1
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 0
% 0.20/0.49 # ...of those cached : 0
% 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 : 1
% 0.20/0.49 # Positive orientable unit clauses : 0
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 1
% 0.20/0.49 # Non-unit-clauses : 0
% 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 : 1
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.49 # Non-unit clause-clause subsumptions : 0
% 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 : 0
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 102
% 0.20/0.49 # Search garbage collected termcells : 25
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.003 s
% 0.20/0.49 # System time : 0.001 s
% 0.20/0.49 # Total time : 0.004 s
% 0.20/0.49 # Maximum resident set size: 1624 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.003 s
% 0.20/0.49 # System time : 0.004 s
% 0.20/0.49 # Total time : 0.007 s
% 0.20/0.49 # Maximum resident set size: 1692 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------