TSTP Solution File: SYO217^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO217^5 : TPTP v8.2.0. Released v4.0.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:45:10 EDT 2024
% Result : Theorem 0.24s 0.51s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 17 ( 6 unt; 6 typ; 0 def)
% Number of atoms : 23 ( 4 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 58 ( 10 ~; 5 |; 2 &; 36 @)
% ( 2 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 14 ( 0 ^ 14 !; 0 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
b: $tType ).
thf(decl_sort2,type,
a: $tType ).
thf(decl_22,type,
epred1_0: b > a > $o ).
thf(decl_23,type,
epred2_0: b > a > $o ).
thf(decl_24,type,
esk1_0: b ).
thf(decl_25,type,
esk2_0: a ).
thf(cTHM174,conjecture,
! [X1: b > a > $o,X2: b > a > $o] :
( ! [X3: b,X4: a] :
( ( X1 @ X3 @ X4 )
<=> ( X2 @ X3 @ X4 ) )
=> ( X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM174) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: b > a > $o,X2: b > a > $o] :
( ! [X3: b,X4: a] :
( ( X1 @ X3 @ X4 )
<=> ( X2 @ X3 @ X4 ) )
=> ( X1 = X2 ) ),
inference(assume_negation,[status(cth)],[cTHM174]) ).
thf(c_0_2,negated_conjecture,
! [X11: b,X12: a] :
( ( ~ ( epred1_0 @ X11 @ X12 )
| ( epred2_0 @ X11 @ X12 ) )
& ( ~ ( epred2_0 @ X11 @ X12 )
| ( epred1_0 @ X11 @ X12 ) )
& ( epred1_0 != epred2_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_1])])])])]) ).
thf(c_0_3,negated_conjecture,
epred1_0 != epred2_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( ( epred1_0 @ esk1_0 @ esk2_0 )
<~> ( epred2_0 @ esk1_0 @ esk2_0 ) ),
inference(neg_ext,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
( ~ ( epred1_0 @ esk1_0 @ esk2_0 )
| ~ ( epred2_0 @ esk1_0 @ esk2_0 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X3: b,X4: a] :
( ( epred1_0 @ X3 @ X4 )
| ~ ( epred2_0 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
~ ( epred2_0 @ esk1_0 @ esk2_0 ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_8,negated_conjecture,
! [X3: b,X4: a] :
( ( epred2_0 @ X3 @ X4 )
| ~ ( epred1_0 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
epred1_0 @ esk1_0 @ esk2_0,
inference(sr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_4]),c_0_7]) ).
thf(c_0_10,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYO217^5 : TPTP v8.2.0. Released v4.0.0.
% 0.14/0.15 % Command : run_E %s %d THM
% 0.15/0.39 % Computer : n020.cluster.edu
% 0.15/0.39 % Model : x86_64 x86_64
% 0.15/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.39 % Memory : 8042.1875MB
% 0.15/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.39 % CPULimit : 300
% 0.15/0.39 % WCLimit : 300
% 0.15/0.39 % DateTime : Mon May 20 10:16:23 EDT 2024
% 0.15/0.39 % CPUTime :
% 0.24/0.50 Running higher-order theorem proving
% 0.24/0.50 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.24/0.51 # Version: 3.1.0-ho
% 0.24/0.51 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.24/0.51 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.24/0.51 # Starting new_bool_9 with 300s (1) cores
% 0.24/0.51 # Starting post_as_ho1 with 300s (1) cores
% 0.24/0.51 # Starting post_as_ho4 with 300s (1) cores
% 0.24/0.51 # Starting post_as_ho2 with 300s (1) cores
% 0.24/0.51 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.24/0.51 # Starting full_lambda_10 with 300s (1) cores
% 0.24/0.51 # Starting new_ho_8 with 300s (1) cores
% 0.24/0.51 # post_as_ho12 with pid 27407 completed with status 0
% 0.24/0.51 # Result found by post_as_ho12
% 0.24/0.51 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.24/0.51 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.24/0.51 # No SInE strategy applied
% 0.24/0.51 # Search class: HHUSF-FFSF00-SSSFFFNN
% 0.24/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.24/0.51 # new_ho_10 with pid 27416 completed with status 0
% 0.24/0.51 # Result found by new_ho_10
% 0.24/0.51 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.24/0.51 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.24/0.51 # No SInE strategy applied
% 0.24/0.51 # Search class: HHUSF-FFSF00-SSSFFFNN
% 0.24/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.24/0.51 # Preprocessing time : 0.001 s
% 0.24/0.51 # Presaturation interreduction done
% 0.24/0.51
% 0.24/0.51 # Proof found!
% 0.24/0.51 # SZS status Theorem
% 0.24/0.51 # SZS output start CNFRefutation
% See solution above
% 0.24/0.51 # Parsed axioms : 3
% 0.24/0.51 # Removed by relevancy pruning/SinE : 0
% 0.24/0.51 # Initial clauses : 5
% 0.24/0.51 # Removed in clause preprocessing : 2
% 0.24/0.51 # Initial clauses in saturation : 3
% 0.24/0.51 # Processed clauses : 14
% 0.24/0.51 # ...of these trivial : 0
% 0.24/0.51 # ...subsumed : 0
% 0.24/0.51 # ...remaining for further processing : 14
% 0.24/0.51 # Other redundant clauses eliminated : 0
% 0.24/0.51 # Clauses deleted for lack of memory : 0
% 0.24/0.51 # Backward-subsumed : 1
% 0.24/0.51 # Backward-rewritten : 0
% 0.24/0.51 # Generated clauses : 11
% 0.24/0.51 # ...of the previous two non-redundant : 9
% 0.24/0.51 # ...aggressively subsumed : 0
% 0.24/0.51 # Contextual simplify-reflections : 1
% 0.24/0.51 # Paramodulations : 4
% 0.24/0.51 # Factorizations : 0
% 0.24/0.51 # NegExts : 3
% 0.24/0.51 # Equation resolutions : 0
% 0.24/0.51 # Disequality decompositions : 0
% 0.24/0.51 # Total rewrite steps : 0
% 0.24/0.51 # ...of those cached : 0
% 0.24/0.51 # Propositional unsat checks : 0
% 0.24/0.51 # Propositional check models : 0
% 0.24/0.51 # Propositional check unsatisfiable : 0
% 0.24/0.51 # Propositional clauses : 0
% 0.24/0.51 # Propositional clauses after purity: 0
% 0.24/0.51 # Propositional unsat core size : 0
% 0.24/0.51 # Propositional preprocessing time : 0.000
% 0.24/0.51 # Propositional encoding time : 0.000
% 0.24/0.51 # Propositional solver time : 0.000
% 0.24/0.51 # Success case prop preproc time : 0.000
% 0.24/0.51 # Success case prop encoding time : 0.000
% 0.24/0.51 # Success case prop solver time : 0.000
% 0.24/0.51 # Current number of processed clauses : 8
% 0.24/0.51 # Positive orientable unit clauses : 1
% 0.24/0.51 # Positive unorientable unit clauses: 0
% 0.24/0.51 # Negative unit clauses : 5
% 0.24/0.51 # Non-unit-clauses : 2
% 0.24/0.51 # Current number of unprocessed clauses: 1
% 0.24/0.51 # ...number of literals in the above : 2
% 0.24/0.51 # Current number of archived formulas : 0
% 0.24/0.51 # Current number of archived clauses : 6
% 0.24/0.51 # Clause-clause subsumption calls (NU) : 3
% 0.24/0.51 # Rec. Clause-clause subsumption calls : 1
% 0.24/0.51 # Non-unit clause-clause subsumptions : 1
% 0.24/0.51 # Unit Clause-clause subsumption calls : 6
% 0.24/0.51 # Rewrite failures with RHS unbound : 0
% 0.24/0.51 # BW rewrite match attempts : 0
% 0.24/0.51 # BW rewrite match successes : 0
% 0.24/0.51 # Condensation attempts : 14
% 0.24/0.51 # Condensation successes : 0
% 0.24/0.51 # Termbank termtop insertions : 494
% 0.24/0.51 # Search garbage collected termcells : 100
% 0.24/0.51
% 0.24/0.51 # -------------------------------------------------
% 0.24/0.51 # User time : 0.003 s
% 0.24/0.51 # System time : 0.001 s
% 0.24/0.51 # Total time : 0.004 s
% 0.24/0.51 # Maximum resident set size: 1760 pages
% 0.24/0.51
% 0.24/0.51 # -------------------------------------------------
% 0.24/0.51 # User time : 0.005 s
% 0.24/0.51 # System time : 0.003 s
% 0.24/0.51 # Total time : 0.007 s
% 0.24/0.51 # Maximum resident set size: 1716 pages
% 0.24/0.51 % E---3.1 exiting
% 0.24/0.51 % E exiting
%------------------------------------------------------------------------------