TSTP Solution File: SEV060^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV060^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 04:07:30 EDT 2024
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 21 ( 8 unt; 8 typ; 0 def)
% Number of atoms : 27 ( 10 equ; 0 cnn)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 88 ( 12 ~; 10 |; 8 &; 52 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 22 ( 0 ^ 22 !; 0 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
b: $tType ).
thf(decl_sort2,type,
a: $tType ).
thf(decl_22,type,
esk1_0: b ).
thf(decl_23,type,
esk2_0: a ).
thf(decl_24,type,
epred1_0: b > a > $o ).
thf(decl_25,type,
epred2_0: b > a > $o ).
thf(decl_26,type,
esk3_0: b ).
thf(decl_27,type,
esk4_0: a ).
thf(cTHM173_pme,conjecture,
! [X1: b,X2: a,X3: b > a > $o,X4: b > a > $o] :
( ( ! [X5: b,X6: a] :
( ( X4 @ X5 @ X6 )
=> ( ( X3 @ X5 @ X6 )
| ( ( X5 = X1 )
& ( X6 = X2 ) ) ) )
& ~ ( X4 @ X1 @ X2 ) )
=> ! [X7: b,X8: a] :
( ( X4 @ X7 @ X8 )
=> ( X3 @ X7 @ X8 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM173_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: b,X2: a,X3: b > a > $o,X4: b > a > $o] :
( ( ! [X5: b,X6: a] :
( ( X4 @ X5 @ X6 )
=> ( ( X3 @ X5 @ X6 )
| ( ( X5 = X1 )
& ( X6 = X2 ) ) ) )
& ~ ( X4 @ X1 @ X2 ) )
=> ! [X7: b,X8: a] :
( ( X4 @ X7 @ X8 )
=> ( X3 @ X7 @ X8 ) ) ),
inference(assume_negation,[status(cth)],[cTHM173_pme]) ).
thf(c_0_2,negated_conjecture,
! [X21: b,X22: a] :
( ( ( X21 = esk1_0 )
| ( epred1_0 @ X21 @ X22 )
| ~ ( epred2_0 @ X21 @ X22 ) )
& ( ( X22 = esk2_0 )
| ( epred1_0 @ X21 @ X22 )
| ~ ( epred2_0 @ X21 @ X22 ) )
& ~ ( epred2_0 @ esk1_0 @ esk2_0 )
& ( epred2_0 @ esk3_0 @ esk4_0 )
& ~ ( epred1_0 @ esk3_0 @ esk4_0 ) ),
inference(distribute,[status(thm)],[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 @ esk3_0 @ esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: b,X2: a] :
( ( X1 = esk1_0 )
| ( epred1_0 @ X1 @ X2 )
| ~ ( epred2_0 @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
epred2_0 @ esk3_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
esk3_0 = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5])]) ).
thf(c_0_7,negated_conjecture,
~ ( epred1_0 @ esk1_0 @ esk4_0 ),
inference(rw,[status(thm)],[c_0_3,c_0_6]) ).
thf(c_0_8,negated_conjecture,
! [X1: b,X2: a] :
( ( X2 = esk2_0 )
| ( epred1_0 @ X1 @ X2 )
| ~ ( epred2_0 @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
epred2_0 @ esk1_0 @ esk4_0,
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_10,negated_conjecture,
~ ( epred2_0 @ esk1_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
esk2_0 = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEV060^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n006.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 19:19:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.49 Running higher-order theorem proving
% 0.21/0.49 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.21/0.51 # Version: 3.1.0-ho
% 0.21/0.51 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.51 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.51 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.51 # Starting post_as_ho4 with 300s (1) cores
% 0.21/0.51 # Starting post_as_ho2 with 300s (1) cores
% 0.21/0.51 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.51 # Starting full_lambda_10 with 300s (1) cores
% 0.21/0.51 # Starting new_ho_8 with 300s (1) cores
% 0.21/0.51 # new_bool_9 with pid 15130 completed with status 0
% 0.21/0.51 # Result found by new_bool_9
% 0.21/0.51 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.51 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.21/0.51 # Search class: HGUSF-FFSF00-SSSFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting new_ho_10 with 150s (1) cores
% 0.21/0.51 # new_ho_10 with pid 15137 completed with status 0
% 0.21/0.51 # Result found by new_ho_10
% 0.21/0.51 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.51 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.21/0.51 # Search class: HGUSF-FFSF00-SSSFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting new_ho_10 with 150s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Theorem
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 3
% 0.21/0.51 # Removed by relevancy pruning/SinE : 2
% 0.21/0.51 # Initial clauses : 5
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 5
% 0.21/0.51 # Processed clauses : 14
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 0
% 0.21/0.51 # ...remaining for further processing : 14
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 0
% 0.21/0.51 # Backward-rewritten : 4
% 0.21/0.51 # Generated clauses : 2
% 0.21/0.51 # ...of the previous two non-redundant : 5
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 2
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 7
% 0.21/0.51 # ...of those cached : 3
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 5
% 0.21/0.51 # Positive orientable unit clauses : 3
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 1
% 0.21/0.51 # Non-unit-clauses : 1
% 0.21/0.51 # Current number of unprocessed clauses: 0
% 0.21/0.51 # ...number of literals in the above : 0
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 9
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.51 # Non-unit clause-clause subsumptions : 0
% 0.21/0.51 # Unit Clause-clause subsumption calls : 0
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 2
% 0.21/0.51 # BW rewrite match successes : 2
% 0.21/0.51 # Condensation attempts : 14
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 435
% 0.21/0.51 # Search garbage collected termcells : 178
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.001 s
% 0.21/0.51 # System time : 0.003 s
% 0.21/0.51 # Total time : 0.005 s
% 0.21/0.51 # Maximum resident set size: 1768 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.001 s
% 0.21/0.51 # System time : 0.007 s
% 0.21/0.51 # Total time : 0.008 s
% 0.21/0.51 # Maximum resident set size: 1720 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------