TSTP Solution File: SEU850^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU850^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 03:30:40 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 40 ( 7 unt; 7 typ; 0 def)
% Number of atoms : 103 ( 8 equ; 0 cnn)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 212 ( 40 ~; 49 |; 15 &; 98 @)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 18 ( 0 ^ 18 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
epred1_0: a > $o ).
thf(decl_23,type,
epred2_0: a > $o ).
thf(decl_24,type,
epred3_0: a > $o ).
thf(decl_25,type,
esk1_0: a ).
thf(decl_26,type,
esk2_0: a ).
thf(decl_27,type,
esk3_0: a ).
thf(cGAZING_THM9_pme,conjecture,
! [X1: a > $o,X2: a > $o,X3: a > $o] :
( ( ( X1 = X2 )
& ( X2 = X3 ) )
=> ( ! [X4: a] :
( ( X1 @ X4 )
=> ( X2 @ X4 ) )
& ! [X4: a] :
( ( X2 @ X4 )
=> ( X3 @ X4 ) )
& ! [X4: a] :
( ( X3 @ X4 )
=> ( X1 @ X4 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cGAZING_THM9_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > $o,X2: a > $o,X3: a > $o] :
( ( ( X1 = X2 )
& ( X2 = X3 ) )
=> ( ! [X4: a] :
( ( X1 @ X4 )
=> ( X2 @ X4 ) )
& ! [X4: a] :
( ( X2 @ X4 )
=> ( X3 @ X4 ) )
& ! [X4: a] :
( ( X3 @ X4 )
=> ( X1 @ X4 ) ) ) ),
inference(assume_negation,[status(cth)],[cGAZING_THM9_pme]) ).
thf(c_0_2,negated_conjecture,
( ( epred1_0 = epred2_0 )
& ( epred2_0 = epred3_0 )
& ( ( epred3_0 @ esk3_0 )
| ( epred2_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk3_0 )
| ( epred2_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred3_0 @ esk3_0 )
| ~ ( epred3_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk3_0 )
| ~ ( epred3_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred3_0 @ esk3_0 )
| ( epred2_0 @ esk2_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk3_0 )
| ( epred2_0 @ esk2_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ( epred3_0 @ esk3_0 )
| ~ ( epred3_0 @ esk2_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk3_0 )
| ~ ( epred3_0 @ esk2_0 )
| ~ ( epred2_0 @ esk1_0 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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,
epred2_0 = epred3_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X18: a] :
( ( epred3_0 @ X18 )
<=> ( epred2_0 @ X18 ) ),
inference(arg_cong,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
epred1_0 = epred2_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X4: a] :
( ( epred2_0 @ X4 )
| ~ ( epred3_0 @ X4 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
( ( epred3_0 @ esk3_0 )
| ~ ( epred3_0 @ esk2_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
( ( epred3_0 @ esk3_0 )
| ( epred2_0 @ esk2_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ esk3_0 )
| ~ ( epred3_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
! [X4: a] :
( ( epred3_0 @ X4 )
| ~ ( epred2_0 @ X4 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_4]) ).
thf(c_0_11,negated_conjecture,
( ( epred2_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_12,negated_conjecture,
! [X17: a] :
( ( epred1_0 @ X17 )
<=> ( epred2_0 @ X17 ) ),
inference(arg_cong,[status(thm)],[c_0_5]) ).
thf(c_0_13,negated_conjecture,
( ~ ( epred1_0 @ esk3_0 )
| ~ ( epred3_0 @ esk2_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_14,negated_conjecture,
( ( epred2_0 @ esk2_0 )
| ~ ( epred1_0 @ esk3_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_15,negated_conjecture,
( ( epred2_0 @ esk3_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred3_0 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_16,negated_conjecture,
( ( epred2_0 @ esk2_0 )
| ( epred2_0 @ esk3_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
thf(c_0_17,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ esk3_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
thf(c_0_18,negated_conjecture,
! [X4: a] :
( ( epred1_0 @ X4 )
| ~ ( epred2_0 @ X4 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_12]) ).
thf(c_0_19,negated_conjecture,
( ~ ( epred1_0 @ esk3_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_10]),c_0_14]) ).
thf(c_0_20,negated_conjecture,
( ( epred2_0 @ esk3_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_10]),c_0_16]) ).
thf(c_0_21,negated_conjecture,
( ( epred3_0 @ esk3_0 )
| ( epred2_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_22,negated_conjecture,
! [X4: a] :
( ( epred2_0 @ X4 )
| ~ ( epred1_0 @ X4 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_12]) ).
thf(c_0_23,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_24,negated_conjecture,
~ ( epred2_0 @ esk1_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_18]),c_0_20]) ).
thf(c_0_25,negated_conjecture,
( ( epred2_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_21]) ).
thf(c_0_26,negated_conjecture,
~ ( epred2_0 @ esk3_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
thf(c_0_27,negated_conjecture,
( ( epred3_0 @ esk3_0 )
| ( epred1_0 @ esk1_0 )
| ~ ( epred3_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_28,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk2_0 ) ),
inference(sr,[status(thm)],[c_0_25,c_0_26]) ).
thf(c_0_29,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk3_0 )
| ~ ( epred3_0 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_27]) ).
thf(c_0_30,negated_conjecture,
epred2_0 @ esk2_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_28]),c_0_24]) ).
thf(c_0_31,negated_conjecture,
epred1_0 @ esk1_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_10]),c_0_30])]),c_0_26]) ).
thf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_31]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SEU850^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n003.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 17:00:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running higher-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.21/0.50 # Version: 3.1.0-ho
% 0.21/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho4 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho2 with 300s (1) cores
% 0.21/0.50 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.50 # Starting full_lambda_10 with 300s (1) cores
% 0.21/0.50 # Starting new_ho_8 with 300s (1) cores
% 0.21/0.50 # new_bool_9 with pid 1878 completed with status 0
% 0.21/0.50 # Result found by new_bool_9
% 0.21/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.21/0.50 # Search class: HGHSF-FFSS00-SSSFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting new_ho_10 with 181s (1) cores
% 0.21/0.50 # new_ho_10 with pid 1888 completed with status 0
% 0.21/0.50 # Result found by new_ho_10
% 0.21/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.21/0.50 # Search class: HGHSF-FFSS00-SSSFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting new_ho_10 with 181s (1) cores
% 0.21/0.50 # Preprocessing time : 0.002 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 2
% 0.21/0.50 # Removed by relevancy pruning/SinE : 1
% 0.21/0.50 # Initial clauses : 10
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 10
% 0.21/0.50 # Processed clauses : 39
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 0
% 0.21/0.50 # ...remaining for further processing : 39
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 12
% 0.21/0.50 # Backward-rewritten : 4
% 0.21/0.50 # Generated clauses : 25
% 0.21/0.50 # ...of the previous two non-redundant : 22
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 4
% 0.21/0.50 # Paramodulations : 18
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 5
% 0.21/0.50 # ...of those cached : 3
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 10
% 0.21/0.50 # Positive orientable unit clauses : 4
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 2
% 0.21/0.50 # Non-unit-clauses : 4
% 0.21/0.50 # Current number of unprocessed clauses: 1
% 0.21/0.50 # ...number of literals in the above : 3
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 29
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 35
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 34
% 0.21/0.50 # Non-unit clause-clause subsumptions : 11
% 0.21/0.50 # Unit Clause-clause subsumption calls : 5
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 2
% 0.21/0.50 # BW rewrite match successes : 2
% 0.21/0.50 # Condensation attempts : 39
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 901
% 0.21/0.50 # Search garbage collected termcells : 172
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.006 s
% 0.21/0.50 # System time : 0.001 s
% 0.21/0.50 # Total time : 0.007 s
% 0.21/0.50 # Maximum resident set size: 1812 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.007 s
% 0.21/0.50 # System time : 0.003 s
% 0.21/0.50 # Total time : 0.011 s
% 0.21/0.50 # Maximum resident set size: 1712 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E exiting
%------------------------------------------------------------------------------