TSTP Solution File: SYO517^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO517^1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:47:32 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 12 ( 4 unt; 3 typ; 0 def)
% Number of atoms : 16 ( 3 equ; 0 cnn)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 55 ( 6 ~; 3 |; 4 &; 38 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 26 ( 26 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 17 ( 0 ^ 13 !; 4 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
epred1_1: ( ( $i > $o ) > $i ) > $i > $o ).
thf(decl_23,type,
esk1_1: ( ( $i > $o ) > $i ) > $i ).
thf(decl_24,type,
esk2_0: ( $i > $o ) > $i ).
thf(descri,conjecture,
? [X1: ( $i > $o ) > $i] :
! [X2: $i > $o] :
( ? [X3: $i] :
( ( X2 @ X3 )
& ! [X4: $i] :
( ( X2 @ X4 )
=> ( X3 = X4 ) ) )
=> ( X2 @ ( X1 @ X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',descri) ).
thf(c_0_1,negated_conjecture,
~ ? [X1: ( $i > $o ) > $i] :
! [X2: $i > $o] :
( ? [X3: $i] :
( ( X2 @ X3 )
& ! [X4: $i] :
( ( X2 @ X4 )
=> ( X3 = X4 ) ) )
=> ( X2 @ ( X1 @ X2 ) ) ),
inference(assume_negation,[status(cth)],[descri]) ).
thf(c_0_2,negated_conjecture,
! [X9: ( $i > $o ) > $i,X12: $i] :
( ( epred1_1 @ X9 @ ( esk1_1 @ X9 ) )
& ( ~ ( epred1_1 @ X9 @ X12 )
| ( ( esk1_1 @ X9 )
= X12 ) )
& ~ ( epred1_1 @ X9 @ ( X9 @ ( epred1_1 @ X9 ) ) ) ),
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_1])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X1: ( $i > $o ) > $i] :
~ ( epred1_1 @ X1 @ ( X1 @ ( epred1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,plain,
! [X13: $i > $o,X14: $i] :
( ( X13 @ ( esk2_0 @ X13 ) )
| ~ ( X13 @ X14 ) ),
inference(introduce_choice_axiom,[status(thm)],]) ).
thf(c_0_5,negated_conjecture,
! [X1: ( $i > $o ) > $i,X3: $i] :
( ( epred1_1 @ X1 @ ( esk2_0 @ ( epred1_1 @ X1 ) ) )
| ~ ( epred1_1 @ X1 @ X3 ) ),
inference(choice_inst,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X1: ( $i > $o ) > $i] : ( epred1_1 @ X1 @ ( esk1_1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X1: ( $i > $o ) > $i] : ( epred1_1 @ X1 @ ( esk2_0 @ ( epred1_1 @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_8,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_3,c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO517^1 : TPTP v8.2.0. Released v4.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n005.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 09:29:23 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/0.47 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: HSSSSMSSSSSNHHA.
% 0.20/0.49 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting sh2lt with 1200s (4) cores
% 0.20/0.49 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.49 # Starting full_lambda_6 with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.49 # Starting ehoh_best3_rw with 300s (1) cores
% 0.20/0.49 # sh2lt with pid 5722 completed with status 0
% 0.20/0.49 # Result found by sh2lt
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.49 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting sh2lt with 1200s (4) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.20/0.49 # Search class: HHUSF-FFSF11-SHHFFFBN
% 0.20/0.49 # partial match(2): HGUSF-FFSF11-SHHFFSBN
% 0.20/0.49 # Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 0.20/0.49 # Starting sh5l with 240s (1) cores
% 0.20/0.49 # Starting sh2lt with 121s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 240s (1) cores
% 0.20/0.49 # Starting new_bool_2 with 240s (1) cores
% 0.20/0.49 # sh2lt with pid 5729 completed with status 0
% 0.20/0.49 # Result found by sh2lt
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.49 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting sh2lt with 1200s (4) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.20/0.49 # Search class: HHUSF-FFSF11-SHHFFFBN
% 0.20/0.49 # partial match(2): HGUSF-FFSF11-SHHFFSBN
% 0.20/0.49 # Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 0.20/0.49 # Starting sh5l with 240s (1) cores
% 0.20/0.49 # Starting sh2lt with 121s (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 : 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 : 8
% 0.20/0.49 # ...of these trivial : 0
% 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 : 1
% 0.20/0.49 # Generated clauses : 5
% 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 : 3
% 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 : 1
% 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 : 4
% 0.20/0.49 # Positive orientable unit clauses : 2
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 1
% 0.20/0.49 # Non-unit-clauses : 1
% 0.20/0.49 # Current number of unprocessed clauses: 1
% 0.20/0.49 # ...number of literals in the above : 2
% 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 : 1
% 0.20/0.49 # BW rewrite match successes : 1
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 400
% 0.20/0.49 # Search garbage collected termcells : 101
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.002 s
% 0.20/0.49 # System time : 0.002 s
% 0.20/0.49 # Total time : 0.004 s
% 0.20/0.49 # Maximum resident set size: 1860 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.008 s
% 0.20/0.49 # System time : 0.005 s
% 0.20/0.49 # Total time : 0.013 s
% 0.20/0.49 # Maximum resident set size: 1704 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------