TSTP Solution File: SEV166^5 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SEV166^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 : Mon Jun 24 15:53:51 EDT 2024
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 12 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 28 ( 27 equ; 0 cnn)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 70 ( 10 ~; 10 |; 4 &; 44 @)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 16 ( 2 ^ 14 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
esk1_0: a ).
thf(decl_23,type,
esk2_0: a ).
thf(decl_24,type,
esk3_0: a ).
thf(decl_25,type,
esk4_0: a ).
thf(decl_26,type,
esk5_0: a > a > a ).
thf(cTHM182_pme,conjecture,
! [X1: a,X2: a,X3: a,X4: a] :
( ( ( ^ [X5: a > a > a] : ( X5 @ X1 @ X2 ) )
= ( ^ [X5: a > a > a] : ( X5 @ X3 @ X4 ) ) )
<=> ( ( X1 = X3 )
& ( X2 = X4 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.5dlla1rGkD/E---3.1_17781.p',cTHM182_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a,X2: a,X3: a,X4: a] :
( ! [X10: a > a > a] :
( ( X10 @ X1 @ X2 )
= ( X10 @ X3 @ X4 ) )
<=> ( ( X1 = X3 )
& ( X2 = X4 ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM182_pme])])]) ).
thf(c_0_2,negated_conjecture,
! [X16: a > a > a] :
( ( ( ( esk5_0 @ esk1_0 @ esk2_0 )
!= ( esk5_0 @ esk3_0 @ esk4_0 ) )
| ( esk1_0 != esk3_0 )
| ( esk2_0 != esk4_0 ) )
& ( ( esk1_0 = esk3_0 )
| ( ( X16 @ esk1_0 @ esk2_0 )
= ( X16 @ esk3_0 @ esk4_0 ) ) )
& ( ( esk2_0 = esk4_0 )
| ( ( X16 @ esk1_0 @ esk2_0 )
= ( X16 @ 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,
! [X5: a > a > a] :
( ( esk1_0 = esk3_0 )
| ( ( X5 @ esk1_0 @ esk2_0 )
= ( X5 @ esk3_0 @ esk4_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( ( ( esk5_0 @ esk1_0 @ esk2_0 )
!= ( esk5_0 @ esk3_0 @ esk4_0 ) )
| ( esk1_0 != esk3_0 )
| ( esk2_0 != esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
esk3_0 = esk1_0,
inference(ef,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
! [X5: a > a > a] :
( ( esk2_0 = esk4_0 )
| ( ( X5 @ esk1_0 @ esk2_0 )
= ( X5 @ esk3_0 @ esk4_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
( ( ( esk5_0 @ esk1_0 @ esk2_0 )
!= ( esk5_0 @ esk1_0 @ esk4_0 ) )
| ( esk2_0 != esk4_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5]),c_0_5])]) ).
thf(c_0_8,negated_conjecture,
! [X5: a > a > a] :
( ( ( X5 @ esk1_0 @ esk4_0 )
= ( X5 @ esk1_0 @ esk2_0 ) )
| ( esk2_0 = esk4_0 ) ),
inference(rw,[status(thm)],[c_0_6,c_0_5]) ).
thf(c_0_9,negated_conjecture,
! [X5: a > a > a] :
( ( X5 @ esk1_0 @ esk4_0 )
= ( X5 @ esk1_0 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_10,negated_conjecture,
esk2_0 != esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_9])]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_10,c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEV166^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n019.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Jun 21 19:08:39 EDT 2024
% 0.12/0.34 % 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/tmp/tmp.5dlla1rGkD/E---3.1_17781.p
% 0.21/0.51 # Version: 3.2.0-ho
% 0.21/0.51 # Preprocessing class: HSSSSMSSSSSNHHN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting post_as_ho2 with 1500s (5) cores
% 0.21/0.51 # Starting new_ho_13 with 300s (1) cores
% 0.21/0.51 # Starting new_ho_8 with 300s (1) cores
% 0.21/0.51 # Starting new_ho_4 with 300s (1) cores
% 0.21/0.51 # post_as_ho2 with pid 17859 completed with status 0
% 0.21/0.51 # Result found by post_as_ho2
% 0.21/0.51 # Preprocessing class: HSSSSMSSSSSNHHN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting post_as_ho2 with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: HGHPF-FFSF00-SHHFFMNN
% 0.21/0.51 # partial match(2): HUHPF-FFSF00-SHHFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting new_ho_10 with 811s (1) cores
% 0.21/0.51 # Starting post_as_ho2 with 151s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.51 # Starting new_bool_2 with 136s (1) cores
% 0.21/0.51 # Starting new_bool_9 with 136s (1) cores
% 0.21/0.51 # new_ho_10 with pid 17865 completed with status 9
% 0.21/0.51 # Starting sh5l with 130s (1) cores
% 0.21/0.51 # new_bool_1 with pid 17868 completed with status 9
% 0.21/0.51 # new_bool_9 with pid 17870 completed with status 9
% 0.21/0.51 # post_as_ho2 with pid 17866 completed with status 0
% 0.21/0.51 # Result found by post_as_ho2
% 0.21/0.51 # Preprocessing class: HSSSSMSSSSSNHHN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting post_as_ho2 with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: HGHPF-FFSF00-SHHFFMNN
% 0.21/0.51 # partial match(2): HUHPF-FFSF00-SHHFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting new_ho_10 with 811s (1) cores
% 0.21/0.51 # Starting post_as_ho2 with 151s (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 : 2
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 4
% 0.21/0.51 # Removed in clause preprocessing : 1
% 0.21/0.51 # Initial clauses in saturation : 3
% 0.21/0.51 # Processed clauses : 11
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 0
% 0.21/0.51 # ...remaining for further processing : 11
% 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 : 1
% 0.21/0.51 # Backward-rewritten : 4
% 0.21/0.51 # Generated clauses : 82
% 0.21/0.51 # ...of the previous two non-redundant : 55
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 70
% 0.21/0.51 # Factorizations : 12
% 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 : 8
% 0.21/0.51 # ...of those cached : 6
% 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 : 3
% 0.21/0.51 # Positive orientable unit clauses : 1
% 0.21/0.51 # Positive unorientable unit clauses: 1
% 0.21/0.51 # Negative unit clauses : 1
% 0.21/0.51 # Non-unit-clauses : 0
% 0.21/0.51 # Current number of unprocessed clauses: 29
% 0.21/0.51 # ...number of literals in the above : 59
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 8
% 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 : 1
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 17
% 0.21/0.51 # BW rewrite match successes : 5
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 3076
% 0.21/0.51 # Search garbage collected termcells : 114
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.014 s
% 0.21/0.51 # System time : 0.001 s
% 0.21/0.51 # Total time : 0.015 s
% 0.21/0.51 # Maximum resident set size: 1816 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.017 s
% 0.21/0.51 # System time : 0.005 s
% 0.21/0.51 # Total time : 0.022 s
% 0.21/0.51 # Maximum resident set size: 1708 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------