TSTP Solution File: SEV002^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV002^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:12 EDT 2024
% Result : Theorem 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 17 ( 8 unt; 6 typ; 0 def)
% Number of atoms : 41 ( 40 equ; 0 cnn)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 296 ( 4 ~; 0 |; 28 &; 262 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 34 ( 8 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 88 ( 0 ^ 88 !; 0 ?; 88 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
esk1_0: a > a > a ).
thf(decl_23,type,
esk2_0: a > a > a ).
thf(decl_24,type,
esk3_0: a ).
thf(decl_25,type,
esk4_0: a ).
thf(decl_26,type,
esk5_0: a ).
thf(cMODULAR_THM_DEF2_pme,conjecture,
! [X1: a > a > a,X2: a > a > a] :
( ( ! [X3: a] :
( ( X1 @ X3 @ X3 )
= X3 )
& ! [X3: a] :
( ( X2 @ X3 @ X3 )
= X3 )
& ! [X3: a,X4: a,X5: a] :
( ( X1 @ ( X1 @ X3 @ X4 ) @ X5 )
= ( X1 @ X3 @ ( X1 @ X4 @ X5 ) ) )
& ! [X3: a,X4: a,X5: a] :
( ( X2 @ ( X2 @ X3 @ X4 ) @ X5 )
= ( X2 @ X3 @ ( X2 @ X4 @ X5 ) ) )
& ! [X3: a,X4: a] :
( ( X1 @ X3 @ X4 )
= ( X1 @ X4 @ X3 ) )
& ! [X3: a,X4: a] :
( ( X2 @ X3 @ X4 )
= ( X2 @ X4 @ X3 ) )
& ! [X3: a,X4: a] :
( ( X1 @ ( X2 @ X3 @ X4 ) @ X4 )
= X4 )
& ! [X3: a,X4: a] :
( ( X2 @ ( X1 @ X3 @ X4 ) @ X4 )
= X4 )
& ! [X3: a,X4: a,X5: a] :
( ( X1 @ X3 @ ( X2 @ X4 @ X5 ) )
= ( X2 @ ( X1 @ X3 @ X4 ) @ ( X1 @ X3 @ X5 ) ) )
& ! [X3: a,X4: a,X5: a] :
( ( X2 @ X3 @ ( X1 @ X4 @ X5 ) )
= ( X1 @ ( X2 @ X3 @ X4 ) @ ( X2 @ X3 @ X5 ) ) ) )
=> ! [X3: a,X4: a,X5: a] :
( ( X1 @ X3 @ ( X2 @ X4 @ ( X1 @ X3 @ X5 ) ) )
= ( X2 @ ( X1 @ X3 @ X4 ) @ ( X1 @ X3 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cMODULAR_THM_DEF2_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > a > a,X2: a > a > a] :
( ( ! [X3: a] :
( ( X1 @ X3 @ X3 )
= X3 )
& ! [X3: a] :
( ( X2 @ X3 @ X3 )
= X3 )
& ! [X3: a,X4: a,X5: a] :
( ( X1 @ ( X1 @ X3 @ X4 ) @ X5 )
= ( X1 @ X3 @ ( X1 @ X4 @ X5 ) ) )
& ! [X3: a,X4: a,X5: a] :
( ( X2 @ ( X2 @ X3 @ X4 ) @ X5 )
= ( X2 @ X3 @ ( X2 @ X4 @ X5 ) ) )
& ! [X3: a,X4: a] :
( ( X1 @ X3 @ X4 )
= ( X1 @ X4 @ X3 ) )
& ! [X3: a,X4: a] :
( ( X2 @ X3 @ X4 )
= ( X2 @ X4 @ X3 ) )
& ! [X3: a,X4: a] :
( ( X1 @ ( X2 @ X3 @ X4 ) @ X4 )
= X4 )
& ! [X3: a,X4: a] :
( ( X2 @ ( X1 @ X3 @ X4 ) @ X4 )
= X4 )
& ! [X3: a,X4: a,X5: a] :
( ( X1 @ X3 @ ( X2 @ X4 @ X5 ) )
= ( X2 @ ( X1 @ X3 @ X4 ) @ ( X1 @ X3 @ X5 ) ) )
& ! [X3: a,X4: a,X5: a] :
( ( X2 @ X3 @ ( X1 @ X4 @ X5 ) )
= ( X1 @ ( X2 @ X3 @ X4 ) @ ( X2 @ X3 @ X5 ) ) ) )
=> ! [X3: a,X4: a,X5: a] :
( ( X1 @ X3 @ ( X2 @ X4 @ ( X1 @ X3 @ X5 ) ) )
= ( X2 @ ( X1 @ X3 @ X4 ) @ ( X1 @ X3 @ X5 ) ) ) ),
inference(assume_negation,[status(cth)],[cMODULAR_THM_DEF2_pme]) ).
thf(c_0_2,negated_conjecture,
! [X35: a,X36: a,X37: a,X38: a,X39: a,X40: a,X41: a,X42: a,X43: a,X44: a,X45: a,X46: a,X47: a,X48: a,X49: a,X50: a,X51: a,X52: a,X53: a,X54: a,X55: a,X56: a] :
( ( ( esk1_0 @ X35 @ X35 )
= X35 )
& ( ( esk2_0 @ X36 @ X36 )
= X36 )
& ( ( esk1_0 @ ( esk1_0 @ X37 @ X38 ) @ X39 )
= ( esk1_0 @ X37 @ ( esk1_0 @ X38 @ X39 ) ) )
& ( ( esk2_0 @ ( esk2_0 @ X40 @ X41 ) @ X42 )
= ( esk2_0 @ X40 @ ( esk2_0 @ X41 @ X42 ) ) )
& ( ( esk1_0 @ X43 @ X44 )
= ( esk1_0 @ X44 @ X43 ) )
& ( ( esk2_0 @ X45 @ X46 )
= ( esk2_0 @ X46 @ X45 ) )
& ( ( esk1_0 @ ( esk2_0 @ X47 @ X48 ) @ X48 )
= X48 )
& ( ( esk2_0 @ ( esk1_0 @ X49 @ X50 ) @ X50 )
= X50 )
& ( ( esk1_0 @ X51 @ ( esk2_0 @ X52 @ X53 ) )
= ( esk2_0 @ ( esk1_0 @ X51 @ X52 ) @ ( esk1_0 @ X51 @ X53 ) ) )
& ( ( esk2_0 @ X54 @ ( esk1_0 @ X55 @ X56 ) )
= ( esk1_0 @ ( esk2_0 @ X54 @ X55 ) @ ( esk2_0 @ X54 @ X56 ) ) )
& ( ( esk1_0 @ esk3_0 @ ( esk2_0 @ esk4_0 @ ( esk1_0 @ esk3_0 @ esk5_0 ) ) )
!= ( esk2_0 @ ( esk1_0 @ esk3_0 @ esk4_0 ) @ ( esk1_0 @ esk3_0 @ esk5_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,
! [X3: a,X4: a,X5: a] :
( ( esk1_0 @ ( esk1_0 @ X3 @ X4 ) @ X5 )
= ( esk1_0 @ X3 @ ( esk1_0 @ X4 @ X5 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X3: a] :
( ( esk1_0 @ X3 @ X3 )
= X3 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
( ( esk1_0 @ esk3_0 @ ( esk2_0 @ esk4_0 @ ( esk1_0 @ esk3_0 @ esk5_0 ) ) )
!= ( esk2_0 @ ( esk1_0 @ esk3_0 @ esk4_0 ) @ ( esk1_0 @ esk3_0 @ esk5_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X3: a,X4: a,X5: a] :
( ( esk1_0 @ X3 @ ( esk2_0 @ X4 @ X5 ) )
= ( esk2_0 @ ( esk1_0 @ X3 @ X4 ) @ ( esk1_0 @ X3 @ X5 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X3: a,X4: a] :
( ( esk1_0 @ X3 @ ( esk1_0 @ X3 @ X4 ) )
= ( esk1_0 @ X3 @ X4 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_8,negated_conjecture,
( ( esk1_0 @ esk3_0 @ ( esk2_0 @ esk4_0 @ ( esk1_0 @ esk3_0 @ esk5_0 ) ) )
!= ( esk1_0 @ esk3_0 @ ( esk2_0 @ esk4_0 @ esk5_0 ) ) ),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X3: a,X4: a,X5: a] :
( ( esk1_0 @ X3 @ ( esk2_0 @ X4 @ ( esk1_0 @ X3 @ X5 ) ) )
= ( esk1_0 @ X3 @ ( esk2_0 @ X4 @ X5 ) ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_6]) ).
thf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV002^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n028.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 19:10:23 EDT 2024
% 0.13/0.33 % 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.50 # Version: 3.1.0-ho
% 0.19/0.50 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting post_as_ho1 with 1500s (5) cores
% 0.19/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.19/0.50 # Starting new_ho_3 with 300s (1) cores
% 0.19/0.50 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.19/0.50 # post_as_ho1 with pid 10415 completed with status 0
% 0.19/0.50 # Result found by post_as_ho1
% 0.19/0.50 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting post_as_ho1 with 1500s (5) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: HUUPM-FFSF00-MSSFFFNN
% 0.19/0.50 # partial match(2): HUUPF-FFSF00-SSSFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 # Starting new_ho_10 with 811s (1) cores
% 0.19/0.50 # Starting post_as_ho1 with 151s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.50 # Starting new_bool_2 with 136s (1) cores
% 0.19/0.50 # Starting new_bool_9 with 136s (1) cores
% 0.19/0.50 # post_as_ho1 with pid 10422 completed with status 0
% 0.19/0.50 # Result found by post_as_ho1
% 0.19/0.50 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting post_as_ho1 with 1500s (5) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: HUUPM-FFSF00-MSSFFFNN
% 0.19/0.50 # partial match(2): HUUPF-FFSF00-SSSFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 # Starting new_ho_10 with 811s (1) cores
% 0.19/0.50 # Starting post_as_ho1 with 151s (1) cores
% 0.19/0.50 # Preprocessing time : 0.001 s
% 0.19/0.50 # Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 # Proof found!
% 0.19/0.50 # SZS status Theorem
% 0.19/0.50 # SZS output start CNFRefutation
% See solution above
% 0.19/0.50 # Parsed axioms : 2
% 0.19/0.50 # Removed by relevancy pruning/SinE : 0
% 0.19/0.50 # Initial clauses : 12
% 0.19/0.50 # Removed in clause preprocessing : 1
% 0.19/0.50 # Initial clauses in saturation : 11
% 0.19/0.50 # Processed clauses : 197
% 0.19/0.50 # ...of these trivial : 58
% 0.19/0.50 # ...subsumed : 76
% 0.19/0.50 # ...remaining for further processing : 63
% 0.19/0.50 # Other redundant clauses eliminated : 0
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 0
% 0.19/0.50 # Backward-rewritten : 6
% 0.19/0.50 # Generated clauses : 2155
% 0.19/0.50 # ...of the previous two non-redundant : 1260
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 0
% 0.19/0.50 # Paramodulations : 2155
% 0.19/0.50 # Factorizations : 0
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 0
% 0.19/0.50 # Disequality decompositions : 0
% 0.19/0.50 # Total rewrite steps : 2647
% 0.19/0.50 # ...of those cached : 1779
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.51 # Propositional check unsatisfiable : 0
% 0.19/0.51 # Propositional clauses : 0
% 0.19/0.51 # Propositional clauses after purity: 0
% 0.19/0.51 # Propositional unsat core size : 0
% 0.19/0.51 # Propositional preprocessing time : 0.000
% 0.19/0.51 # Propositional encoding time : 0.000
% 0.19/0.51 # Propositional solver time : 0.000
% 0.19/0.51 # Success case prop preproc time : 0.000
% 0.19/0.51 # Success case prop encoding time : 0.000
% 0.19/0.51 # Success case prop solver time : 0.000
% 0.19/0.51 # Current number of processed clauses : 46
% 0.19/0.51 # Positive orientable unit clauses : 40
% 0.19/0.51 # Positive unorientable unit clauses: 6
% 0.19/0.51 # Negative unit clauses : 0
% 0.19/0.51 # Non-unit-clauses : 0
% 0.19/0.51 # Current number of unprocessed clauses: 1085
% 0.19/0.51 # ...number of literals in the above : 1085
% 0.19/0.51 # Current number of archived formulas : 0
% 0.19/0.51 # Current number of archived clauses : 17
% 0.19/0.51 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.51 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.51 # Non-unit clause-clause subsumptions : 0
% 0.19/0.51 # Unit Clause-clause subsumption calls : 8
% 0.19/0.51 # Rewrite failures with RHS unbound : 0
% 0.19/0.51 # BW rewrite match attempts : 168
% 0.19/0.51 # BW rewrite match successes : 108
% 0.19/0.51 # Condensation attempts : 0
% 0.19/0.51 # Condensation successes : 0
% 0.19/0.51 # Termbank termtop insertions : 17143
% 0.19/0.51 # Search garbage collected termcells : 466
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.026 s
% 0.19/0.51 # System time : 0.005 s
% 0.19/0.51 # Total time : 0.031 s
% 0.19/0.51 # Maximum resident set size: 1824 pages
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.123 s
% 0.19/0.51 # System time : 0.015 s
% 0.19/0.51 # Total time : 0.138 s
% 0.19/0.51 # Maximum resident set size: 1720 pages
% 0.19/0.51 % E---3.1 exiting
% 0.19/0.51 % E exiting
%------------------------------------------------------------------------------