TSTP Solution File: SYO005^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO005^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:11 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 19 ( 9 unt; 6 typ; 0 def)
% Number of atoms : 17 ( 6 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 51 ( 5 ~; 2 |; 2 &; 34 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 30 ( 30 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 23 ( 8 ^ 15 !; 0 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
leibeq1: $i > $i > $o ).
thf(decl_23,type,
leibeq2: ( $i > $i ) > ( $i > $i ) > $o ).
thf(decl_24,type,
esk1_0: $i > $i ).
thf(decl_25,type,
esk2_0: $i > $i ).
thf(decl_26,type,
esk3_0: $i ).
thf(decl_27,type,
epred1_0: $i > $o ).
thf(leibeq1,axiom,
( leibeq1
= ( ^ [X1: $i,X2: $i] :
! [X3: $i > $o] :
( ( X3 @ X1 )
=> ( X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leibeq1) ).
thf(leibeq2,axiom,
( leibeq2
= ( ^ [X4: $i > $i,X5: $i > $i] :
! [X6: ( $i > $i ) > $o] :
( ( X6 @ X4 )
=> ( X6 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leibeq2) ).
thf(conj,conjecture,
! [X7: $i > $i,X8: $i > $i] :
( ( leibeq2 @ X7 @ X8 )
=> ! [X9: $i] : ( leibeq1 @ ( X7 @ X9 ) @ ( X8 @ X9 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(c_0_3,plain,
( leibeq1
= ( ^ [Z0: $i,Z1: $i] :
! [X3: $i > $o] :
( ( X3 @ Z0 )
=> ( X3 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[leibeq1]) ).
thf(c_0_4,plain,
( leibeq2
= ( ^ [Z0: $i > $i,Z1: $i > $i] :
! [X6: ( $i > $i ) > $o] :
( ( X6 @ Z0 )
=> ( X6 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[leibeq2]) ).
thf(c_0_5,negated_conjecture,
~ ! [X7: $i > $i,X8: $i > $i] :
( ! [X13: ( $i > $i ) > $o] :
( ( X13 @ X7 )
=> ( X13 @ X8 ) )
=> ! [X9: $i,X14: $i > $o] :
( ( X14 @ ( X7 @ X9 ) )
=> ( X14 @ ( X8 @ X9 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]),c_0_3]),c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X17: ( $i > $i ) > $o] :
( ( ~ ( X17 @ esk1_0 )
| ( X17 @ esk2_0 ) )
& ( epred1_0 @ ( esk1_0 @ esk3_0 ) )
& ~ ( epred1_0 @ ( esk2_0 @ esk3_0 ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
thf(c_0_7,negated_conjecture,
! [X6: ( $i > $i ) > $o] :
( ( X6 @ esk2_0 )
| ~ ( X6 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_8,negated_conjecture,
esk2_0 = esk1_0,
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_7]) ).
thf(c_0_9,negated_conjecture,
~ ( epred1_0 @ ( esk2_0 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i] :
( ( esk2_0 @ X1 )
= ( esk1_0 @ X1 ) ),
inference(arg_cong,[status(thm)],[c_0_8]) ).
thf(c_0_11,negated_conjecture,
epred1_0 @ ( esk1_0 @ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO005^1 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon May 20 10:29:23 EDT 2024
% 0.12/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: HSSSSMSSSLSNHSN.
% 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 lpo8_lambda_fix with 300s (1) cores
% 0.20/0.49 # Starting lpo8_s with 300s (1) cores
% 0.20/0.49 # Starting new_bool_11 with 300s (1) cores
% 0.20/0.49 # lpo8_lambda_fix with pid 4620 completed with status 0
% 0.20/0.49 # Result found by lpo8_lambda_fix
% 0.20/0.49 # Preprocessing class: HSSSSMSSSLSNHSN.
% 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 lpo8_lambda_fix with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,,5.0,,4,20000,1.0)
% 0.20/0.49 # Search class: HHUNF-FFSF00-SHSFMSBN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting ho_unfolding_3 with 163s (1) cores
% 0.20/0.49 # ho_unfolding_3 with pid 4623 completed with status 0
% 0.20/0.49 # Result found by ho_unfolding_3
% 0.20/0.49 # Preprocessing class: HSSSSMSSSLSNHSN.
% 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 lpo8_lambda_fix with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,,5.0,,4,20000,1.0)
% 0.20/0.49 # Search class: HHUNF-FFSF00-SHSFMSBN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting ho_unfolding_3 with 163s (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 : 5
% 0.20/0.49 # Removed by relevancy pruning/SinE : 2
% 0.20/0.49 # Initial clauses : 3
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 3
% 0.20/0.49 # Processed clauses : 9
% 0.20/0.49 # ...of these trivial : 1
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 8
% 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 : 2
% 0.20/0.49 # Generated clauses : 4
% 0.20/0.49 # ...of the previous two non-redundant : 3
% 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 : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 4
% 0.20/0.49 # ...of those cached : 1
% 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 : 3
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 0
% 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 : 5
% 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 : 3
% 0.20/0.49 # BW rewrite match successes : 2
% 0.20/0.49 # Condensation attempts : 9
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 383
% 0.20/0.49 # Search garbage collected termcells : 138
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.002 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.005 s
% 0.20/0.49 # Maximum resident set size: 1824 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.002 s
% 0.20/0.49 # System time : 0.006 s
% 0.20/0.49 # Total time : 0.008 s
% 0.20/0.49 # Maximum resident set size: 1728 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------