TSTP Solution File: SYO030^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO030^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:44:17 EDT 2024
% Result : Theorem 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 4 unt; 2 typ; 0 def)
% Number of atoms : 18 ( 2 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 46 ( 8 ~; 4 |; 0 &; 30 @)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 2 usr; 2 con; 0-2 aty)
% Number of variables : 18 ( 4 ^ 12 !; 2 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
leibeq: $o > $o > $o ).
thf(decl_23,type,
epred1_1: ( $o > $o ) > $o ).
thf(leibeq,axiom,
( leibeq
= ( ^ [X1: $o,X2: $o] :
! [X3: $o > $o] :
( ( X3 @ X1 )
=> ( X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leibeq) ).
thf(conj,conjecture,
~ ! [X4: $o > $o] :
? [X1: $o] : ( leibeq @ ( X4 @ X1 ) @ X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(c_0_2,plain,
( leibeq
= ( ^ [Z0: $o,Z1: $o] :
! [X3: $o > $o] :
( ( X3 @ Z0 )
=> ( X3 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[leibeq]) ).
thf(c_0_3,negated_conjecture,
~ ~ ! [X4: $o > $o] :
? [X1: $o] :
! [X7: $o > $o] :
( ( X7 @ ( X4 @ X1 ) )
=> ( X7 @ X1 ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]),c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X8: $o > $o,X10: $o > $o] :
( ~ ( X10 @ ( X8 @ ( epred1_1 @ X8 ) ) )
| ( X10 @ ( epred1_1 @ X8 ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
thf(c_0_5,negated_conjecture,
! [X3: $o > $o,X4: $o > $o] :
( ( X3 @ ( epred1_1 @ X4 ) )
| ~ ( X3 @ ( X4 @ ( epred1_1 @ X4 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X4: $o > $o] :
( ( X4 @ ( epred1_1 @ X4 ) )
<=> ( epred1_1 @ X4 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_5]) ).
thf(c_0_7,negated_conjecture,
! [X3: $o > $o] :
( ( X3 @ ( epred1_1 @ X3 ) )
| ~ ( epred1_1 @ X3 ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X3: $o > $o] :
( ( epred1_1 @ X3 )
| ~ ( X3 @ ( epred1_1 @ X3 ) ) ),
inference(dynamic_cnf,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
~ ( epred1_1 @ $not ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_7]) ).
thf(c_0_10,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_8]),c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYO030^1 : TPTP v8.2.0. Released v3.7.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n020.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon May 20 11:03:53 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.45 Running higher-order theorem proving
% 0.17/0.45 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.17/0.46 # Version: 3.1.0-ho
% 0.17/0.46 # Preprocessing class: HSSSSMSSSLSNSSN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting ehoh_best3_fo with 1500s (5) cores
% 0.17/0.46 # Starting post_as_ho12 with 300s (1) cores
% 0.17/0.46 # Starting post_as_ho4 with 300s (1) cores
% 0.17/0.46 # Starting ehoh_best6_lambda with 300s (1) cores
% 0.17/0.46 # ehoh_best3_fo with pid 11470 completed with status 0
% 0.17/0.46 # Result found by ehoh_best3_fo
% 0.17/0.46 # Preprocessing class: HSSSSMSSSLSNSSN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting ehoh_best3_fo with 1500s (5) cores
% 0.17/0.46 # No SInE strategy applied
% 0.17/0.46 # Search class: HHUNF-FFSF00-SSSFMMBN
% 0.17/0.46 # partial match(1): HHUNF-FFSF00-SSSFFMBN
% 0.17/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.46 # Starting ehoh_best_nonlift with 811s (1) cores
% 0.17/0.46 # Starting ehoh_best3_fo with 151s (1) cores
% 0.17/0.46 # Starting sh2l with 136s (1) cores
% 0.17/0.46 # Starting lpo1_def_fix with 136s (1) cores
% 0.17/0.46 # Starting ehoh_best3_rw with 136s (1) cores
% 0.17/0.46 # ehoh_best_nonlift with pid 11475 completed with status 9
% 0.17/0.46 # sh2l with pid 11478 completed with status 9
% 0.17/0.46 # lpo1_def_fix with pid 11479 completed with status 9
% 0.17/0.46 # Starting sh2lt with 130s (1) cores
% 0.17/0.46 # ehoh_best3_fo with pid 11477 completed with status 0
% 0.17/0.46 # Result found by ehoh_best3_fo
% 0.17/0.46 # Preprocessing class: HSSSSMSSSLSNSSN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting ehoh_best3_fo with 1500s (5) cores
% 0.17/0.46 # No SInE strategy applied
% 0.17/0.46 # Search class: HHUNF-FFSF00-SSSFMMBN
% 0.17/0.46 # partial match(1): HHUNF-FFSF00-SSSFFMBN
% 0.17/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.46 # Starting ehoh_best_nonlift with 811s (1) cores
% 0.17/0.46 # Starting ehoh_best3_fo with 151s (1) cores
% 0.17/0.46 # Preprocessing time : 0.001 s
% 0.17/0.46 # Presaturation interreduction done
% 0.17/0.46
% 0.17/0.46 # Proof found!
% 0.17/0.46 # SZS status Theorem
% 0.17/0.46 # SZS output start CNFRefutation
% See solution above
% 0.17/0.46 # Parsed axioms : 3
% 0.17/0.46 # Removed by relevancy pruning/SinE : 0
% 0.17/0.46 # Initial clauses : 2
% 0.17/0.46 # Removed in clause preprocessing : 1
% 0.17/0.46 # Initial clauses in saturation : 1
% 0.17/0.46 # Processed clauses : 8
% 0.17/0.46 # ...of these trivial : 0
% 0.17/0.46 # ...subsumed : 1
% 0.17/0.46 # ...remaining for further processing : 7
% 0.17/0.46 # Other redundant clauses eliminated : 0
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 0
% 0.17/0.46 # Backward-rewritten : 0
% 0.17/0.46 # Generated clauses : 15
% 0.17/0.46 # ...of the previous two non-redundant : 10
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 0
% 0.17/0.46 # Paramodulations : 0
% 0.17/0.46 # Factorizations : 0
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 0
% 0.17/0.46 # Disequality decompositions : 0
% 0.17/0.46 # Total rewrite steps : 0
% 0.17/0.46 # ...of those cached : 0
% 0.17/0.46 # Propositional unsat checks : 0
% 0.17/0.46 # Propositional check models : 0
% 0.17/0.46 # Propositional check unsatisfiable : 0
% 0.17/0.46 # Propositional clauses : 0
% 0.17/0.46 # Propositional clauses after purity: 0
% 0.17/0.46 # Propositional unsat core size : 0
% 0.17/0.46 # Propositional preprocessing time : 0.000
% 0.17/0.46 # Propositional encoding time : 0.000
% 0.17/0.46 # Propositional solver time : 0.000
% 0.17/0.46 # Success case prop preproc time : 0.000
% 0.17/0.46 # Success case prop encoding time : 0.000
% 0.17/0.46 # Success case prop solver time : 0.000
% 0.17/0.46 # Current number of processed clauses : 4
% 0.17/0.46 # Positive orientable unit clauses : 0
% 0.17/0.46 # Positive unorientable unit clauses: 0
% 0.17/0.46 # Negative unit clauses : 1
% 0.17/0.46 # Non-unit-clauses : 3
% 0.17/0.46 # Current number of unprocessed clauses: 3
% 0.17/0.46 # ...number of literals in the above : 5
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 3
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 7
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 5
% 0.17/0.46 # Non-unit clause-clause subsumptions : 1
% 0.17/0.46 # Unit Clause-clause subsumption calls : 2
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 0
% 0.17/0.46 # BW rewrite match successes : 0
% 0.17/0.46 # Condensation attempts : 0
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 608
% 0.17/0.46 # Search garbage collected termcells : 73
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.007 s
% 0.17/0.46 # System time : 0.004 s
% 0.17/0.46 # Total time : 0.010 s
% 0.17/0.46 # Maximum resident set size: 1768 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.009 s
% 0.17/0.46 # System time : 0.006 s
% 0.17/0.46 # Total time : 0.015 s
% 0.17/0.46 # Maximum resident set size: 1704 pages
% 0.17/0.46 % E---3.1 exiting
% 0.17/0.46 % E exiting
%------------------------------------------------------------------------------