TSTP Solution File: SEU948^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU948^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:56 EDT 2024
% Result : Theorem 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 23 ( 4 unt; 7 typ; 0 def)
% Number of atoms : 20 ( 0 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 185 ( 17 ~; 20 |; 14 &; 120 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 8 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 53 ( 53 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 65 ( 39 ^ 26 !; 0 ?; 65 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
esk1_0: a > a ).
thf(decl_23,type,
esk2_0: a > a ).
thf(decl_24,type,
esk3_0: a > a ).
thf(decl_25,type,
esk4_1: ( ( a > a ) > $o ) > a > a ).
thf(decl_26,type,
esk5_1: ( ( a > a ) > $o ) > a > a ).
thf(decl_27,type,
epred1_0: ( a > a ) > $o ).
thf(cTHM135_pme,conjecture,
! [X1: a > a,X2: a > a,X3: a > a] :
( ( ! [X4: ( a > a ) > $o] :
( ( ( X4
@ ^ [X5: a] : X5 )
& ! [X6: a > a] :
( ( X4 @ X6 )
=> ( X4
@ ^ [X7: a] : ( X1 @ ( X6 @ X7 ) ) ) ) )
=> ( X4 @ X2 ) )
& ! [X4: ( a > a ) > $o] :
( ( ( X4
@ ^ [X5: a] : X5 )
& ! [X6: a > a] :
( ( X4 @ X6 )
=> ( X4
@ ^ [X7: a] : ( X1 @ ( X6 @ X7 ) ) ) ) )
=> ( X4 @ X3 ) ) )
=> ! [X4: ( a > a ) > $o] :
( ( ( X4
@ ^ [X5: a] : X5 )
& ! [X6: a > a] :
( ( X4 @ X6 )
=> ( X4
@ ^ [X7: a] : ( X1 @ ( X6 @ X7 ) ) ) ) )
=> ( X4
@ ^ [X7: a] : ( X2 @ ( X3 @ X7 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM135_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > a,X2: a > a,X3: a > a] :
( ( ! [X4: ( a > a ) > $o] :
( ( ( X4
@ ^ [Z0: a] : Z0 )
& ! [X6: a > a] :
( ( X4 @ X6 )
=> ( X4
@ ^ [Z0: a] : ( X1 @ ( X6 @ Z0 ) ) ) ) )
=> ( X4 @ X2 ) )
& ! [X4: ( a > a ) > $o] :
( ( ( X4
@ ^ [Z0: a] : Z0 )
& ! [X6: a > a] :
( ( X4 @ X6 )
=> ( X4
@ ^ [Z0: a] : ( X1 @ ( X6 @ Z0 ) ) ) ) )
=> ( X4 @ X3 ) ) )
=> ! [X4: ( a > a ) > $o] :
( ( ( X4
@ ^ [Z0: a] : Z0 )
& ! [X6: a > a] :
( ( X4 @ X6 )
=> ( X4
@ ^ [Z0: a] : ( X1 @ ( X6 @ Z0 ) ) ) ) )
=> ( X4
@ ^ [Z0: a] : ( X2 @ ( X3 @ Z0 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM135_pme])]) ).
thf(c_0_2,negated_conjecture,
! [X20: ( a > a ) > $o,X22: ( a > a ) > $o,X25: a > a] :
( ( ( X20 @ ( esk4_1 @ X20 ) )
| ~ ( X20
@ ^ [Z0: a] : Z0 )
| ( X20 @ esk2_0 ) )
& ( ~ ( X20
@ ^ [Z0: a] : ( esk1_0 @ ( esk4_1 @ X20 @ Z0 ) ) )
| ~ ( X20
@ ^ [Z0: a] : Z0 )
| ( X20 @ esk2_0 ) )
& ( ( X22 @ ( esk5_1 @ X22 ) )
| ~ ( X22
@ ^ [Z0: a] : Z0 )
| ( X22 @ esk3_0 ) )
& ( ~ ( X22
@ ^ [Z0: a] : ( esk1_0 @ ( esk5_1 @ X22 @ Z0 ) ) )
| ~ ( X22
@ ^ [Z0: a] : Z0 )
| ( X22 @ esk3_0 ) )
& ( epred1_0
@ ^ [Z0: a] : Z0 )
& ( ~ ( epred1_0 @ X25 )
| ( epred1_0
@ ^ [Z0: a] : ( esk1_0 @ ( X25 @ Z0 ) ) ) )
& ~ ( epred1_0
@ ^ [Z0: a] : ( esk2_0 @ ( esk3_0 @ Z0 ) ) ) ),
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,
! [X4: ( a > a ) > $o] :
( ( X4 @ ( esk5_1 @ X4 ) )
| ( X4 @ esk3_0 )
| ~ ( X4
@ ^ [Z0: a] : Z0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( epred1_0
@ ^ [Z0: a] : Z0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X1: a > a] :
( ( epred1_0
@ ^ [Z0: a] : ( esk1_0 @ ( X1 @ Z0 ) ) )
| ~ ( epred1_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
( ( epred1_0 @ ( esk5_1 @ epred1_0 ) )
| ( epred1_0 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X4: ( a > a ) > $o] :
( ( X4 @ esk3_0 )
| ~ ( X4
@ ^ [Z0: a] : ( esk1_0 @ ( esk5_1 @ X4 @ Z0 ) ) )
| ~ ( X4
@ ^ [Z0: a] : Z0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
( ( epred1_0
@ ^ [Z0: a] : ( esk1_0 @ ( esk5_1 @ epred1_0 @ Z0 ) ) )
| ( epred1_0 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X4: ( a > a ) > $o] :
( ( X4 @ ( esk4_1 @ X4 ) )
| ( X4 @ esk2_0 )
| ~ ( X4
@ ^ [Z0: a] : Z0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
epred1_0 @ esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_4])]) ).
thf(c_0_11,negated_conjecture,
~ ( epred1_0
@ ^ [Z0: a] : ( esk2_0 @ ( esk3_0 @ Z0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_12,negated_conjecture,
( epred1_0
@ ^ [Z0: a] :
( esk4_1
@ ^ [Z1: a > a] :
( epred1_0
@ ^ [Z2: a] : ( Z1 @ ( esk3_0 @ Z2 ) ) )
@ ( esk3_0 @ Z0 ) ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
thf(c_0_13,negated_conjecture,
! [X4: ( a > a ) > $o] :
( ( X4 @ esk2_0 )
| ~ ( X4
@ ^ [Z0: a] : ( esk1_0 @ ( esk4_1 @ X4 @ Z0 ) ) )
| ~ ( X4
@ ^ [Z0: a] : Z0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_14,negated_conjecture,
( epred1_0
@ ^ [Z0: a] :
( esk1_0
@ ( esk4_1
@ ^ [Z1: a > a] :
( epred1_0
@ ^ [Z2: a] : ( Z1 @ ( esk3_0 @ Z2 ) ) )
@ ( esk3_0 @ Z0 ) ) ) ),
inference(spm,[status(thm)],[c_0_5,c_0_12]) ).
thf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_10])]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU948^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n014.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sun May 19 17:56:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running higher-order theorem proving
% 0.19/0.46 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.19/0.49 # Version: 3.1.0-ho
% 0.19/0.49 # Preprocessing class: HSSSSMSSSSMNHHA.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting post_as_ho5 with 1500s (5) cores
% 0.19/0.49 # Starting sh2lt with 300s (1) cores
% 0.19/0.49 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.19/0.49 # Starting post_as_ho10 with 300s (1) cores
% 0.19/0.49 # post_as_ho5 with pid 2240 completed with status 0
% 0.19/0.49 # Result found by post_as_ho5
% 0.19/0.49 # Preprocessing class: HSSSSMSSSSMNHHA.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting post_as_ho5 with 1500s (5) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.19/0.49 # Search class: HGUNF-FFSF11-MHHFFMBN
% 0.19/0.49 # partial match(1): HGUNF-FFSF11-SHHFFMBN
% 0.19/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49 # Starting ho_unfolding_3 with 811s (1) cores
% 0.19/0.49 # Starting post_as_ho5 with 151s (1) cores
% 0.19/0.49 # Starting sh5l with 136s (1) cores
% 0.19/0.49 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.49 # post_as_ho5 with pid 2245 completed with status 0
% 0.19/0.49 # Result found by post_as_ho5
% 0.19/0.49 # Preprocessing class: HSSSSMSSSSMNHHA.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting post_as_ho5 with 1500s (5) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.19/0.49 # Search class: HGUNF-FFSF11-MHHFFMBN
% 0.19/0.49 # partial match(1): HGUNF-FFSF11-SHHFFMBN
% 0.19/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49 # Starting ho_unfolding_3 with 811s (1) cores
% 0.19/0.49 # Starting post_as_ho5 with 151s (1) cores
% 0.19/0.49 # Preprocessing time : 0.001 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Theorem
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 2
% 0.19/0.49 # Removed by relevancy pruning/SinE : 1
% 0.19/0.49 # Initial clauses : 7
% 0.19/0.49 # Removed in clause preprocessing : 0
% 0.19/0.49 # Initial clauses in saturation : 7
% 0.19/0.49 # Processed clauses : 69
% 0.19/0.49 # ...of these trivial : 0
% 0.19/0.49 # ...subsumed : 0
% 0.19/0.49 # ...remaining for further processing : 69
% 0.19/0.49 # Other redundant clauses eliminated : 0
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 0
% 0.19/0.49 # Backward-rewritten : 13
% 0.19/0.49 # Generated clauses : 133
% 0.19/0.49 # ...of the previous two non-redundant : 97
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 0
% 0.19/0.49 # Paramodulations : 94
% 0.19/0.49 # Factorizations : 0
% 0.19/0.49 # NegExts : 11
% 0.19/0.49 # Equation resolutions : 4
% 0.19/0.49 # Disequality decompositions : 0
% 0.19/0.49 # Total rewrite steps : 61
% 0.19/0.49 # ...of those cached : 54
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 48
% 0.19/0.49 # Positive orientable unit clauses : 22
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 5
% 0.19/0.49 # Non-unit-clauses : 21
% 0.19/0.49 # Current number of unprocessed clauses: 40
% 0.19/0.49 # ...number of literals in the above : 78
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 21
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 45
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 40
% 0.19/0.49 # Non-unit clause-clause subsumptions : 0
% 0.19/0.49 # Unit Clause-clause subsumption calls : 4
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 107
% 0.19/0.49 # BW rewrite match successes : 2
% 0.19/0.49 # Condensation attempts : 0
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 12171
% 0.19/0.49 # Search garbage collected termcells : 307
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.012 s
% 0.19/0.49 # System time : 0.005 s
% 0.19/0.49 # Total time : 0.017 s
% 0.19/0.49 # Maximum resident set size: 1876 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.065 s
% 0.19/0.49 # System time : 0.012 s
% 0.19/0.49 # Total time : 0.077 s
% 0.19/0.49 # Maximum resident set size: 1732 pages
% 0.19/0.49 % E---3.1 exiting
% 0.19/0.49 % E exiting
%------------------------------------------------------------------------------