TSTP Solution File: SYO010^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO010^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:12 EDT 2024
% Result : Theorem 0.16s 0.43s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 20 ( 12 unt; 4 typ; 0 def)
% Number of atoms : 25 ( 9 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 48 ( 6 ~; 2 |; 4 &; 31 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 24 ( 11 ^ 13 !; 0 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
leibeq: $i > $i > $o ).
thf(decl_23,type,
p: ( $i > $i ) > $o ).
thf(decl_24,type,
f: $i > $i ).
thf(decl_25,type,
esk1_0: $i > $i ).
thf(leibeq,axiom,
( leibeq
= ( ^ [X1: $i,X2: $i] :
! [X3: $i > $o] :
( ( X3 @ X1 )
=> ( X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leibeq) ).
thf(conj,conjecture,
( ( ! [X4: $i] : ( leibeq @ ( f @ X4 ) @ X4 )
& ( p
@ ^ [X4: $i] : X4 ) )
=> ( p
@ ^ [X4: $i] : ( f @ X4 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(c_0_2,plain,
( leibeq
= ( ^ [Z0: $i,Z1: $i] :
! [X3: $i > $o] :
( ( X3 @ Z0 )
=> ( X3 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[leibeq]) ).
thf(c_0_3,negated_conjecture,
~ ( ( ! [X4: $i,X6: $i > $o] :
( ( X6 @ ( f @ X4 ) )
=> ( X6 @ X4 ) )
& ( p
@ ^ [Z0: $i] : Z0 ) )
=> ( p @ f ) ),
inference(fool_unroll,[status(thm)],[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,
! [X7: $i,X8: $i > $o] :
( ( ~ ( X8 @ ( f @ X7 ) )
| ( X8 @ X7 ) )
& ( p
@ ^ [Z0: $i] : Z0 )
& ~ ( p @ f ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
thf(c_0_5,plain,
! [X9: $i] :
( ( esk1_0 @ X9 )
= X9 ),
introduced(definition) ).
thf(c_0_6,plain,
! [X10: $i] :
( ( esk1_0 @ X10 )
= X10 ),
inference(variable_rename,[status(thm)],]) ).
thf(c_0_7,negated_conjecture,
( ( p @ esk1_0 )
= $true ),
inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_4]),c_0_5]) ).
thf(c_0_8,plain,
! [X1: $i] :
( ( esk1_0 @ X1 )
= X1 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
( ( p
@ ^ [Z0: $i] : Z0 )
= $true ),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_10,negated_conjecture,
~ ( p @ f ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_11,negated_conjecture,
( p
@ ^ [Z0: $i] : Z0 ),
inference(cn,[status(thm)],[c_0_9]) ).
thf(c_0_12,negated_conjecture,
! [X3: $i > $o,X1: $i] :
( ( X3 @ X1 )
| ~ ( X3 @ ( f @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_13,plain,
( ( ^ [Z0: $i] : Z0 )
!= f ),
inference(ext_sup,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i] :
( ( f @ X1 )
= X1 ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_12]) ).
thf(c_0_15,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SYO010^1 : TPTP v8.2.0. Released v3.7.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.12/0.30 % Computer : n002.cluster.edu
% 0.12/0.30 % Model : x86_64 x86_64
% 0.12/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.30 % Memory : 8042.1875MB
% 0.12/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Mon May 20 10:56:07 EDT 2024
% 0.12/0.31 % CPUTime :
% 0.16/0.42 Running higher-order theorem proving
% 0.16/0.42 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.16/0.43 # Version: 3.1.0-ho
% 0.16/0.43 # Preprocessing class: HSSSSMSSSLMNSSN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.16/0.43 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.16/0.43 # Starting sh5l with 300s (1) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # ho_unfolding_3 with pid 17026 completed with status 0
% 0.16/0.43 # Result found by ho_unfolding_3
% 0.16/0.43 # Preprocessing class: HSSSSMSSSLMNSSN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.16/0.43 # No SInE strategy applied
% 0.16/0.43 # Search class: HHUNF-FFSF11-SSSFMSBN
% 0.16/0.43 # partial match(1): HHUSF-FFSF11-SSSFMSBN
% 0.16/0.43 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.43 # Starting ho_unfolding_3 with 901s (1) cores
% 0.16/0.43 # Starting ehoh_best_sine_rwall with 151s (1) cores
% 0.16/0.43 # Starting sh5l with 151s (1) cores
% 0.16/0.43 # Starting new_bool_3 with 151s (1) cores
% 0.16/0.43 # Starting new_bool_1 with 146s (1) cores
% 0.16/0.43 # ho_unfolding_3 with pid 17030 completed with status 0
% 0.16/0.43 # Result found by ho_unfolding_3
% 0.16/0.43 # Preprocessing class: HSSSSMSSSLMNSSN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.16/0.43 # No SInE strategy applied
% 0.16/0.43 # Search class: HHUNF-FFSF11-SSSFMSBN
% 0.16/0.43 # partial match(1): HHUSF-FFSF11-SSSFMSBN
% 0.16/0.43 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.43 # Starting ho_unfolding_3 with 901s (1) cores
% 0.16/0.43 # Preprocessing time : 0.001 s
% 0.16/0.43 # Presaturation interreduction done
% 0.16/0.43
% 0.16/0.43 # Proof found!
% 0.16/0.43 # SZS status Theorem
% 0.16/0.43 # SZS output start CNFRefutation
% See solution above
% 0.16/0.43 # Parsed axioms : 5
% 0.16/0.43 # Removed by relevancy pruning/SinE : 0
% 0.16/0.43 # Initial clauses : 7
% 0.16/0.43 # Removed in clause preprocessing : 4
% 0.16/0.43 # Initial clauses in saturation : 3
% 0.16/0.43 # Processed clauses : 8
% 0.16/0.43 # ...of these trivial : 0
% 0.16/0.43 # ...subsumed : 0
% 0.16/0.43 # ...remaining for further processing : 8
% 0.16/0.43 # Other redundant clauses eliminated : 0
% 0.16/0.43 # Clauses deleted for lack of memory : 0
% 0.16/0.43 # Backward-subsumed : 0
% 0.16/0.43 # Backward-rewritten : 1
% 0.16/0.43 # Generated clauses : 4
% 0.16/0.43 # ...of the previous two non-redundant : 3
% 0.16/0.43 # ...aggressively subsumed : 0
% 0.16/0.43 # Contextual simplify-reflections : 0
% 0.16/0.43 # Paramodulations : 0
% 0.16/0.43 # Factorizations : 0
% 0.16/0.43 # NegExts : 1
% 0.16/0.43 # Equation resolutions : 0
% 0.16/0.43 # Disequality decompositions : 0
% 0.16/0.43 # Total rewrite steps : 2
% 0.16/0.43 # ...of those cached : 0
% 0.16/0.43 # Propositional unsat checks : 0
% 0.16/0.43 # Propositional check models : 0
% 0.16/0.43 # Propositional check unsatisfiable : 0
% 0.16/0.43 # Propositional clauses : 0
% 0.16/0.43 # Propositional clauses after purity: 0
% 0.16/0.43 # Propositional unsat core size : 0
% 0.16/0.43 # Propositional preprocessing time : 0.000
% 0.16/0.43 # Propositional encoding time : 0.000
% 0.16/0.43 # Propositional solver time : 0.000
% 0.16/0.43 # Success case prop preproc time : 0.000
% 0.16/0.43 # Success case prop encoding time : 0.000
% 0.16/0.43 # Success case prop solver time : 0.000
% 0.16/0.43 # Current number of processed clauses : 4
% 0.16/0.43 # Positive orientable unit clauses : 2
% 0.16/0.43 # Positive unorientable unit clauses: 0
% 0.16/0.43 # Negative unit clauses : 2
% 0.16/0.43 # Non-unit-clauses : 0
% 0.16/0.43 # Current number of unprocessed clauses: 1
% 0.16/0.43 # ...number of literals in the above : 1
% 0.16/0.43 # Current number of archived formulas : 0
% 0.16/0.43 # Current number of archived clauses : 5
% 0.16/0.43 # Clause-clause subsumption calls (NU) : 0
% 0.16/0.43 # Rec. Clause-clause subsumption calls : 0
% 0.16/0.43 # Non-unit clause-clause subsumptions : 0
% 0.16/0.43 # Unit Clause-clause subsumption calls : 1
% 0.16/0.43 # Rewrite failures with RHS unbound : 0
% 0.16/0.43 # BW rewrite match attempts : 2
% 0.16/0.43 # BW rewrite match successes : 1
% 0.16/0.43 # Condensation attempts : 8
% 0.16/0.43 # Condensation successes : 0
% 0.16/0.43 # Termbank termtop insertions : 374
% 0.16/0.43 # Search garbage collected termcells : 97
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.001 s
% 0.16/0.43 # System time : 0.003 s
% 0.16/0.43 # Total time : 0.004 s
% 0.16/0.43 # Maximum resident set size: 1824 pages
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.008 s
% 0.16/0.43 # System time : 0.007 s
% 0.16/0.43 # Total time : 0.015 s
% 0.16/0.43 # Maximum resident set size: 1712 pages
% 0.16/0.43 % E---3.1 exiting
% 0.16/0.44 % E exiting
%------------------------------------------------------------------------------