TSTP Solution File: SEV167^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV167^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 : Tue May 21 04:07:54 EDT 2024
% Result : Theorem 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 27 ( 10 unt; 8 typ; 0 def)
% Number of atoms : 35 ( 25 equ; 0 cnn)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 141 ( 12 ~; 8 |; 4 &; 111 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 81 ( 81 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 6 con; 0-4 aty)
% Number of variables : 69 ( 24 ^ 45 !; 0 ?; 69 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
epred1_0: a > a > a > a > $o ).
thf(decl_23,type,
esk1_0: a ).
thf(decl_24,type,
esk2_0: a ).
thf(decl_25,type,
esk3_0: a ).
thf(decl_26,type,
esk4_0: a ).
thf(decl_27,type,
esk5_0: a > a > a ).
thf(decl_28,type,
esk6_0: a > a > a ).
thf(cTHM189_pme,conjecture,
! [X1: a > a > a > a > $o] :
( ! [X2: ( a > a > a ) > a,X3: ( a > a > a ) > a] :
( ( X1
@ ( X2
@ ^ [X4: a,X5: a] : X4 )
@ ( X2
@ ^ [X4: a,X5: a] : X5 )
@ ( X3
@ ^ [X4: a,X5: a] : X4 )
@ ( X3
@ ^ [X4: a,X5: a] : X5 ) )
=> ( X2 = X3 ) )
=> ! [X6: a,X7: a,X8: a,X9: a] :
( ( X1 @ X6 @ X7 @ X8 @ X9 )
=> ( ( X6 = X8 )
& ( X7 = X9 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM189_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > a > a > a > $o] :
( ! [X2: ( a > a > a ) > a,X3: ( a > a > a ) > a] :
( ( X1
@ ( X2
@ ^ [Z0: a,Z1: a] : Z0 )
@ ( X2
@ ^ [Z0: a,Z1: a] : Z1 )
@ ( X3
@ ^ [Z0: a,Z1: a] : Z0 )
@ ( X3
@ ^ [Z0: a,Z1: a] : Z1 ) )
=> ( X2 = X3 ) )
=> ! [X6: a,X7: a,X8: a,X9: a] :
( ( X1 @ X6 @ X7 @ X8 @ X9 )
=> ( ( X6 = X8 )
& ( X7 = X9 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM189_pme])]) ).
thf(c_0_2,negated_conjecture,
! [X18: ( a > a > a ) > a,X19: ( a > a > a ) > a] :
( ( ~ ( epred1_0
@ ( X18
@ ^ [Z0: a,Z1: a] : Z0 )
@ ( X18
@ ^ [Z0: a,Z1: a] : Z1 )
@ ( X19
@ ^ [Z0: a,Z1: a] : Z0 )
@ ( X19
@ ^ [Z0: a,Z1: a] : Z1 ) )
| ( X18 = X19 ) )
& ( epred1_0 @ esk1_0 @ esk2_0 @ esk3_0 @ esk4_0 )
& ( ( esk1_0 != esk3_0 )
| ( esk2_0 != esk4_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,plain,
! [X27: a,X26: a] :
( ( esk6_0 @ X26 @ X27 )
= X27 ),
introduced(definition) ).
thf(c_0_4,plain,
! [X25: a,X24: a] :
( ( esk5_0 @ X24 @ X25 )
= X24 ),
introduced(definition) ).
thf(c_0_5,negated_conjecture,
! [X2: ( a > a > a ) > a,X3: ( a > a > a ) > a] :
( ( X2 = X3 )
| ( ( epred1_0 @ ( X2 @ esk5_0 ) @ ( X2 @ esk6_0 ) @ ( X3 @ esk5_0 ) @ ( X3 @ esk6_0 ) )
!= $true ) ),
inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]),c_0_3]),c_0_4]),c_0_3]),c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X2: ( a > a > a ) > a,X3: ( a > a > a ) > a] :
( ( X2 = X3 )
| ~ ( epred1_0 @ ( X2 @ esk5_0 ) @ ( X2 @ esk6_0 ) @ ( X3 @ esk5_0 ) @ ( X3 @ esk6_0 ) ) ),
inference(cn,[status(thm)],[c_0_5]) ).
thf(c_0_7,plain,
! [X34: a,X35: a] :
( ( esk6_0 @ X35 @ X34 )
= X34 ),
inference(variable_rename,[status(thm)],]) ).
thf(c_0_8,plain,
! [X32: a,X33: a] :
( ( esk5_0 @ X33 @ X32 )
= X33 ),
inference(variable_rename,[status(thm)],]) ).
thf(c_0_9,negated_conjecture,
! [X36: a > a > a,X2: ( a > a > a ) > a,X3: ( a > a > a ) > a] :
( ( ( X2 @ X36 )
= ( X3 @ X36 ) )
| ~ ( epred1_0 @ ( X2 @ esk5_0 ) @ ( X2 @ esk6_0 ) @ ( X3 @ esk5_0 ) @ ( X3 @ esk6_0 ) ) ),
inference(arg_cong,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
! [X4: a,X5: a] :
( ( esk6_0 @ X4 @ X5 )
= X5 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
! [X5: a,X4: a] :
( ( esk5_0 @ X4 @ X5 )
= X4 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
! [X3: ( a > a > a ) > a,X2: ( a > a > a ) > a,X36: a > a > a,X11: ( a > a > a ) > a] :
( ( ( X2 @ X36 )
= ( X36 @ ( X3 @ X36 ) @ ( X11 @ X36 ) ) )
| ~ ( epred1_0 @ ( X2 @ esk5_0 ) @ ( X2 @ esk6_0 ) @ ( X3 @ esk5_0 ) @ ( X11 @ esk6_0 ) ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
thf(c_0_13,plain,
! [X3: ( a > a > a ) > a,X2: ( a > a > a ) > a,X11: ( a > a > a ) > a,X36: a > a > a,X12: ( a > a > a ) > a] :
( ( ( X36 @ ( X2 @ X36 ) @ ( X3 @ X36 ) )
= ( X36 @ ( X11 @ X36 ) @ ( X12 @ X36 ) ) )
| ~ ( epred1_0 @ ( X2 @ esk5_0 ) @ ( X3 @ esk6_0 ) @ ( X11 @ esk5_0 ) @ ( X12 @ esk6_0 ) ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_10]),c_0_11]) ).
thf(c_0_14,negated_conjecture,
epred1_0 @ esk1_0 @ esk2_0 @ esk3_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_15,negated_conjecture,
( ( esk1_0 != esk3_0 )
| ( esk2_0 != esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_16,negated_conjecture,
! [X36: a > a > a] :
( ( X36 @ esk1_0 @ esk2_0 )
= ( X36 @ esk3_0 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_17,negated_conjecture,
esk3_0 != esk1_0,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_18,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_17,c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV167^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % 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 : Sun May 19 19:09:08 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running higher-order theorem proving
% 0.19/0.47 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.19/0.50 # Version: 3.1.0-ho
% 0.19/0.50 # Preprocessing class: HSSSSMSSSSLNHHA.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting new_ho_10 with 600s (2) cores
% 0.19/0.50 # Starting sh5l with 600s (2) cores
% 0.19/0.50 # Starting new_bool_1 with 600s (2) cores
% 0.19/0.50 # Starting new_bool_2 with 600s (2) cores
% 0.19/0.50 # new_bool_2 with pid 29668 completed with status 8
% 0.19/0.50 # new_bool_1 with pid 29667 completed with status 8
% 0.19/0.50 # sh5l with pid 29666 completed with status 8
% 0.19/0.50 # new_ho_10 with pid 29665 completed with status 0
% 0.19/0.50 # Result found by new_ho_10
% 0.19/0.50 # Preprocessing class: HSSSSMSSSSLNHHA.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting new_ho_10 with 600s (2) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: HHHSS-FFSF00-SHHFFFNN
% 0.19/0.50 # partial match(1): HGHSS-FFSF00-SHHFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.19/0.50 # Starting post_as_ho4 with 325s (1) cores
% 0.19/0.50 # Starting new_ho_10 with 61s (1) cores
% 0.19/0.50 # new_ho_10 with pid 29676 completed with status 9
% 0.19/0.50 # Starting new_ho_4 with 55s (1) cores
% 0.19/0.50 # post_as_ho4 with pid 29675 completed with status 0
% 0.19/0.50 # Result found by post_as_ho4
% 0.19/0.50 # Preprocessing class: HSSSSMSSSSLNHHA.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting new_ho_10 with 600s (2) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: HHHSS-FFSF00-SHHFFFNN
% 0.19/0.50 # partial match(1): HGHSS-FFSF00-SHHFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.19/0.50 # Starting post_as_ho4 with 325s (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 : 6
% 0.19/0.50 # Removed in clause preprocessing : 1
% 0.19/0.50 # Initial clauses in saturation : 5
% 0.19/0.50 # Processed clauses : 76
% 0.19/0.50 # ...of these trivial : 0
% 0.19/0.50 # ...subsumed : 47
% 0.19/0.50 # ...remaining for further processing : 29
% 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 : 1
% 0.19/0.50 # Backward-rewritten : 0
% 0.19/0.50 # Generated clauses : 628
% 0.19/0.50 # ...of the previous two non-redundant : 619
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 0
% 0.19/0.50 # Paramodulations : 615
% 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 : 613
% 0.19/0.50 # ...of those cached : 563
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 23
% 0.19/0.50 # Positive orientable unit clauses : 3
% 0.19/0.50 # Positive unorientable unit clauses: 1
% 0.19/0.50 # Negative unit clauses : 1
% 0.19/0.50 # Non-unit-clauses : 18
% 0.19/0.50 # Current number of unprocessed clauses: 551
% 0.19/0.50 # ...number of literals in the above : 1078
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 6
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 368
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 272
% 0.19/0.50 # Non-unit clause-clause subsumptions : 47
% 0.19/0.50 # Unit Clause-clause subsumption calls : 2
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 90
% 0.19/0.50 # BW rewrite match successes : 0
% 0.19/0.50 # Condensation attempts : 76
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 37420
% 0.19/0.50 # Search garbage collected termcells : 139
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.027 s
% 0.19/0.50 # System time : 0.001 s
% 0.19/0.50 # Total time : 0.028 s
% 0.19/0.50 # Maximum resident set size: 1856 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.116 s
% 0.19/0.50 # System time : 0.037 s
% 0.19/0.50 # Total time : 0.153 s
% 0.19/0.50 # Maximum resident set size: 1736 pages
% 0.19/0.50 % E---3.1 exiting
% 0.19/0.50 % E exiting
%------------------------------------------------------------------------------