TSTP Solution File: SYO022^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO022^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:16 EDT 2024
% Result : Theorem 0.21s 0.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 16 ( 8 unt; 4 typ; 0 def)
% Number of atoms : 20 ( 3 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 48 ( 22 ~; 6 |; 4 &; 12 @)
% ( 0 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 26 ( 26 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 21 ( 18 ^ 3 !; 0 ?; 21 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
leibeq: ( $o > $o > $o ) > ( $o > $o > $o ) > $o ).
thf(decl_23,type,
epred1_0: ( $o > $o > $o ) > $o ).
thf(decl_24,type,
esk1_0: $o ).
thf(decl_25,type,
esk2_0: $o ).
thf(leibeq,axiom,
( leibeq
= ( ^ [X1: $o > $o > $o,X2: $o > $o > $o] :
! [X3: ( $o > $o > $o ) > $o] :
( ( X3 @ X1 )
=> ( X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leibeq) ).
thf(conj,conjecture,
( leibeq
@ ^ [X4: $o,X5: $o] :
( X4
& X5 )
@ ^ [X6: $o,X7: $o] :
~ ( ~ X6
| ~ X7 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(c_0_2,plain,
( leibeq
= ( ^ [Z0: $o > $o > $o,Z1: $o > $o > $o] :
! [X3: ( $o > $o > $o ) > $o] :
( ( X3 @ Z0 )
=> ( X3 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[leibeq]) ).
thf(c_0_3,negated_conjecture,
~ ! [X8: ( $o > $o > $o ) > $o] :
( ( X8
@ ^ [Z0: $o,Z1: $o] :
( Z0
& Z1 ) )
=> ( X8
@ ^ [Z0: $o,Z1: $o] :
~ ( ~ Z0
| ~ Z1 ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]),c_0_2]) ).
thf(c_0_4,negated_conjecture,
( ( epred1_0 @ $and )
& ~ ( epred1_0
@ ^ [Z0: $o,Z1: $o] :
~ ( ~ Z0
| ~ Z1 ) ) ),
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,
~ ( epred1_0
@ ^ [Z0: $o,Z1: $o] :
~ ( ~ Z0
| ~ Z1 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
epred1_0 @ $and,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,plain,
( ( ^ [Z0: $o,Z1: $o] :
~ ( ~ Z0
| ~ Z1 ) )
!= $and ),
inference(ext_sup,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_8,plain,
( ~ ( ~ esk1_0
| ~ esk2_0 )
<~> ( esk1_0
& esk2_0 ) ),
inference(neg_ext,[status(thm)],[c_0_7]) ).
thf(c_0_9,plain,
esk1_0,
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_8])]) ).
thf(c_0_10,plain,
esk2_0,
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_8])]) ).
thf(c_0_11,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_8])]),c_0_9]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYO022^1 : TPTP v8.2.0. Released v3.7.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n024.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:57:38 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.48 Running higher-order theorem proving
% 0.21/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.21/0.49 # Version: 3.1.0-ho
% 0.21/0.49 # Preprocessing class: HSSSSMSSSLMNHSN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting ho_unfolding_6 with 1500s (5) cores
% 0.21/0.49 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.21/0.49 # Starting sh2l with 300s (1) cores
% 0.21/0.49 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.21/0.49 # ho_unfolding_6 with pid 19350 completed with status 0
% 0.21/0.49 # Result found by ho_unfolding_6
% 0.21/0.49 # Preprocessing class: HSSSSMSSSLMNHSN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting ho_unfolding_6 with 1500s (5) cores
% 0.21/0.49 # No SInE strategy applied
% 0.21/0.49 # Search class: HUUNF-FFSF00-MHSFMFNN
% 0.21/0.49 # partial match(2): HUUNF-FFSF00-SHSSMFNN
% 0.21/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.49 # Starting new_ho_10 with 811s (1) cores
% 0.21/0.49 # Starting ho_unfolding_6 with 151s (1) cores
% 0.21/0.49 # Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.21/0.49 # Starting lpo1_def_fix with 136s (1) cores
% 0.21/0.49 # Starting ehoh_best8_lambda with 136s (1) cores
% 0.21/0.49 # new_ho_10 with pid 19355 completed with status 9
% 0.21/0.49 # Starting sh5l with 130s (1) cores
% 0.21/0.49 # ho_unfolding_6 with pid 19356 completed with status 0
% 0.21/0.49 # Result found by ho_unfolding_6
% 0.21/0.49 # Preprocessing class: HSSSSMSSSLMNHSN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting ho_unfolding_6 with 1500s (5) cores
% 0.21/0.49 # No SInE strategy applied
% 0.21/0.49 # Search class: HUUNF-FFSF00-MHSFMFNN
% 0.21/0.49 # partial match(2): HUUNF-FFSF00-SHSSMFNN
% 0.21/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.49 # Starting new_ho_10 with 811s (1) cores
% 0.21/0.49 # Starting ho_unfolding_6 with 151s (1) cores
% 0.21/0.49 # Preprocessing time : 0.001 s
% 0.21/0.49
% 0.21/0.49 # Proof found!
% 0.21/0.49 # SZS status Theorem
% 0.21/0.49 # SZS output start CNFRefutation
% See solution above
% 0.21/0.49 # Parsed axioms : 3
% 0.21/0.49 # Removed by relevancy pruning/SinE : 0
% 0.21/0.49 # Initial clauses : 3
% 0.21/0.49 # Removed in clause preprocessing : 1
% 0.21/0.49 # Initial clauses in saturation : 2
% 0.21/0.49 # Processed clauses : 9
% 0.21/0.49 # ...of these trivial : 1
% 0.21/0.49 # ...subsumed : 0
% 0.21/0.49 # ...remaining for further processing : 7
% 0.21/0.49 # Other redundant clauses eliminated : 0
% 0.21/0.49 # Clauses deleted for lack of memory : 0
% 0.21/0.49 # Backward-subsumed : 0
% 0.21/0.49 # Backward-rewritten : 1
% 0.21/0.49 # Generated clauses : 9
% 0.21/0.49 # ...of the previous two non-redundant : 10
% 0.21/0.49 # ...aggressively subsumed : 0
% 0.21/0.49 # Contextual simplify-reflections : 0
% 0.21/0.49 # Paramodulations : 0
% 0.21/0.49 # Factorizations : 0
% 0.21/0.49 # NegExts : 3
% 0.21/0.49 # Equation resolutions : 0
% 0.21/0.49 # Disequality decompositions : 0
% 0.21/0.49 # Total rewrite steps : 4
% 0.21/0.49 # ...of those cached : 2
% 0.21/0.49 # Propositional unsat checks : 0
% 0.21/0.49 # Propositional check models : 0
% 0.21/0.49 # Propositional check unsatisfiable : 0
% 0.21/0.49 # Propositional clauses : 0
% 0.21/0.49 # Propositional clauses after purity: 0
% 0.21/0.49 # Propositional unsat core size : 0
% 0.21/0.49 # Propositional preprocessing time : 0.000
% 0.21/0.49 # Propositional encoding time : 0.000
% 0.21/0.49 # Propositional solver time : 0.000
% 0.21/0.49 # Success case prop preproc time : 0.000
% 0.21/0.49 # Success case prop encoding time : 0.000
% 0.21/0.49 # Success case prop solver time : 0.000
% 0.21/0.49 # Current number of processed clauses : 5
% 0.21/0.49 # Positive orientable unit clauses : 3
% 0.21/0.49 # Positive unorientable unit clauses: 0
% 0.21/0.49 # Negative unit clauses : 2
% 0.21/0.49 # Non-unit-clauses : 0
% 0.21/0.49 # Current number of unprocessed clauses: 3
% 0.21/0.49 # ...number of literals in the above : 4
% 0.21/0.49 # Current number of archived formulas : 0
% 0.21/0.49 # Current number of archived clauses : 2
% 0.21/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.49 # Non-unit clause-clause subsumptions : 0
% 0.21/0.49 # Unit Clause-clause subsumption calls : 1
% 0.21/0.49 # Rewrite failures with RHS unbound : 0
% 0.21/0.49 # BW rewrite match attempts : 1
% 0.21/0.49 # BW rewrite match successes : 1
% 0.21/0.49 # Condensation attempts : 9
% 0.21/0.49 # Condensation successes : 0
% 0.21/0.49 # Termbank termtop insertions : 476
% 0.21/0.49 # Search garbage collected termcells : 66
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.004 s
% 0.21/0.49 # System time : 0.003 s
% 0.21/0.49 # Total time : 0.007 s
% 0.21/0.49 # Maximum resident set size: 1796 pages
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.010 s
% 0.21/0.49 # System time : 0.009 s
% 0.21/0.49 # Total time : 0.018 s
% 0.21/0.49 # Maximum resident set size: 1720 pages
% 0.21/0.49 % E---3.1 exiting
% 0.21/0.49 % E exiting
%------------------------------------------------------------------------------