TSTP Solution File: SEV171^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV171^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:55 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 14 ( 3 unt; 5 typ; 0 def)
% Number of atoms : 19 ( 18 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 120 ( 9 ~; 5 |; 3 &; 101 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 67 ( 67 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 1 con; 0-4 aty)
% Number of variables : 36 ( 13 ^ 17 !; 6 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
esk1_1: ( a > ( a > a > a ) > a ) > a ).
thf(decl_23,type,
esk2_1: ( a > ( a > a > a ) > a ) > a ).
thf(decl_24,type,
esk3_1: ( a > ( a > a > a ) > a ) > a ).
thf(decl_25,type,
esk4_2: ( a > ( a > a > a ) > a ) > a > a > a > a ).
thf(cTHM33_pme,conjecture,
? [X1: a > ( a > a > a ) > a] :
( ! [X2: a,X3: a] :
( ( ( X1 @ X2 )
= ( X1 @ X3 ) )
=> ( X2 = X3 ) )
& ! [X4: a] :
? [X5: a,X6: a] :
( ( X1 @ X4 )
= ( ^ [X7: a > a > a] : ( X7 @ X4 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM33_pme) ).
thf(c_0_1,negated_conjecture,
~ ? [X1: a > ( a > a > a ) > a] :
( ! [X2: a,X3: a] :
( ( ( X1 @ X2 )
= ( X1 @ X3 ) )
=> ( X2 = X3 ) )
& ! [X4: a] :
? [X5: a,X6: a] :
! [X14: a > a > a] :
( ( X1 @ X4 @ X14 )
= ( X14 @ X4 @ X5 ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM33_pme])])]) ).
thf(c_0_2,negated_conjecture,
! [X15: a > ( a > a > a ) > a,X19: a] :
( ( ( ( X15 @ ( esk1_1 @ X15 ) )
= ( X15 @ ( esk2_1 @ X15 ) ) )
| ( ( X15 @ ( esk3_1 @ X15 ) @ ( esk4_2 @ X15 @ X19 ) )
!= ( esk4_2 @ X15 @ X19 @ ( esk3_1 @ X15 ) @ X19 ) ) )
& ( ( ( esk1_1 @ X15 )
!= ( esk2_1 @ X15 ) )
| ( ( X15 @ ( esk3_1 @ X15 ) @ ( esk4_2 @ X15 @ X19 ) )
!= ( esk4_2 @ X15 @ X19 @ ( esk3_1 @ X15 ) @ X19 ) ) ) ),
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)],[inference(fof_simplification,[status(thm)],[c_0_1])])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X1: a > ( a > a > a ) > a,X2: a] :
( ( ( X1 @ ( esk1_1 @ X1 ) )
= ( X1 @ ( esk2_1 @ X1 ) ) )
| ( ( X1 @ ( esk3_1 @ X1 ) @ ( esk4_2 @ X1 @ X2 ) )
!= ( esk4_2 @ X1 @ X2 @ ( esk3_1 @ X1 ) @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: a > ( a > a > a ) > a,X2: a] :
( ( ( esk1_1 @ X1 )
!= ( esk2_1 @ X1 ) )
| ( ( X1 @ ( esk3_1 @ X1 ) @ ( esk4_2 @ X1 @ X2 ) )
!= ( esk4_2 @ X1 @ X2 @ ( esk3_1 @ X1 ) @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X1: a > ( a > a > a ) > a,X7: a > a > a,X2: a] :
( ( ( X1 @ ( esk2_1 @ X1 ) @ X7 )
= ( X1 @ ( esk1_1 @ X1 ) @ X7 ) )
| ( ( X1 @ ( esk3_1 @ X1 ) @ ( esk4_2 @ X1 @ X2 ) )
!= ( esk4_2 @ X1 @ X2 @ ( esk3_1 @ X1 ) @ X2 ) ) ),
inference(arg_cong,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
( ( esk2_1
@ ^ [Z0: a,Z1: a > a > a] : ( Z1 @ Z0 @ Z0 ) )
!= ( esk1_1
@ ^ [Z0: a,Z1: a > a > a] : ( Z1 @ Z0 @ Z0 ) ) ),
inference(er,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X7: a > a > a] :
( ( X7
@ ( esk2_1
@ ^ [Z0: a,Z1: a > a > a] : ( Z1 @ Z0 @ Z0 ) )
@ ( esk2_1
@ ^ [Z0: a,Z1: a > a > a] : ( Z1 @ Z0 @ Z0 ) ) )
= ( X7
@ ( esk1_1
@ ^ [Z0: a,Z1: a > a > a] : ( Z1 @ Z0 @ Z0 ) )
@ ( esk1_1
@ ^ [Z0: a,Z1: a > a > a] : ( Z1 @ Z0 @ Z0 ) ) ) ),
inference(er,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_6,c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV171^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n002.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 18:57:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/0.47 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.20/0.50 # Version: 3.1.0-ho
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.50 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting sh2lt with 1200s (4) cores
% 0.20/0.50 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.50 # Starting full_lambda_6 with 300s (1) cores
% 0.20/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.50 # Starting ehoh_best3_rw with 300s (1) cores
% 0.20/0.50 # sh2lt with pid 15157 completed with status 8
% 0.20/0.50 # new_ho_10_unif with pid 15158 completed with status 0
% 0.20/0.50 # Result found by new_ho_10_unif
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.50 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting sh2lt with 1200s (4) cores
% 0.20/0.50 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HHHPF-FFSF21-SHHFFMNN
% 0.20/0.50 # partial match(3): HGHNF-FFSF21-SHHFFMBN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting pre_casc_2 with 109s (1) cores
% 0.20/0.50 # pre_casc_2 with pid 15168 completed with status 9
% 0.20/0.50 # Starting new_ho_10_unif with 31s (1) cores
% 0.20/0.50 # new_ho_10_unif with pid 15176 completed with status 0
% 0.20/0.50 # Result found by new_ho_10_unif
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.50 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting sh2lt with 1200s (4) cores
% 0.20/0.50 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HHHPF-FFSF21-SHHFFMNN
% 0.20/0.50 # partial match(3): HGHNF-FFSF21-SHHFFMBN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting pre_casc_2 with 109s (1) cores
% 0.20/0.50 # pre_casc_2 with pid 15168 completed with status 9
% 0.20/0.50 # Starting new_ho_10_unif with 31s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 2
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 3
% 0.20/0.50 # Removed in clause preprocessing : 1
% 0.20/0.50 # Initial clauses in saturation : 2
% 0.20/0.50 # Processed clauses : 12
% 0.20/0.50 # ...of these trivial : 2
% 0.20/0.50 # ...subsumed : 2
% 0.20/0.50 # ...remaining for further processing : 8
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 33
% 0.20/0.50 # ...of the previous two non-redundant : 30
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 22
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 9
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 2
% 0.20/0.50 # ...of those cached : 1
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 6
% 0.20/0.50 # Positive orientable unit clauses : 1
% 0.20/0.50 # Positive unorientable unit clauses: 1
% 0.20/0.50 # Negative unit clauses : 1
% 0.20/0.50 # Non-unit-clauses : 3
% 0.20/0.50 # Current number of unprocessed clauses: 3
% 0.20/0.50 # ...number of literals in the above : 3
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 2
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 5
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 4
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 2
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 30
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 12
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 9777
% 0.20/0.50 # Search garbage collected termcells : 99
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.011 s
% 0.20/0.50 # System time : 0.005 s
% 0.20/0.50 # Total time : 0.016 s
% 0.20/0.50 # Maximum resident set size: 1804 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.029 s
% 0.20/0.50 # System time : 0.018 s
% 0.20/0.50 # Total time : 0.048 s
% 0.20/0.50 # Maximum resident set size: 1716 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------