TSTP Solution File: SEU895^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU895^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:47 EDT 2024
% Result : Theorem 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 35 ( 5 unt; 9 typ; 0 def)
% Number of atoms : 119 ( 54 equ; 0 cnn)
% Maximal formula atoms : 44 ( 4 avg)
% Number of connectives : 238 ( 30 ~; 73 |; 17 &; 117 @)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 18 ( 2 ^ 10 !; 6 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
b: $tType ).
thf(decl_sort2,type,
a: $tType ).
thf(decl_22,type,
f: b > a ).
thf(decl_23,type,
y: b > $o ).
thf(decl_24,type,
x: b > $o ).
thf(decl_25,type,
esk1_0: a ).
thf(decl_26,type,
esk2_0: b ).
thf(decl_27,type,
esk3_0: b ).
thf(decl_28,type,
esk4_0: b ).
thf(cX5202_pme,conjecture,
( ( ^ [X1: a] :
? [X2: b] :
( ( ( x @ X2 )
| ( y @ X2 ) )
& ( X1
= ( f @ X2 ) ) ) )
= ( ^ [X1: a] :
( ? [X2: b] :
( ( x @ X2 )
& ( X1
= ( f @ X2 ) ) )
| ? [X2: b] :
( ( y @ X2 )
& ( X1
= ( f @ X2 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX5202_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X3: a] :
( ? [X2: b] :
( ( ( x @ X2 )
| ( y @ X2 ) )
& ( X3
= ( f @ X2 ) ) )
<=> ( ? [X2: b] :
( ( x @ X2 )
& ( X3
= ( f @ X2 ) ) )
| ? [X2: b] :
( ( y @ X2 )
& ( X3
= ( f @ X2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cX5202_pme])])]) ).
thf(c_0_2,negated_conjecture,
! [X5: b,X6: b,X7: b] :
( ( ~ ( x @ X6 )
| ( esk1_0
!= ( f @ X6 ) )
| ~ ( x @ X5 )
| ( esk1_0
!= ( f @ X5 ) ) )
& ( ~ ( y @ X7 )
| ( esk1_0
!= ( f @ X7 ) )
| ~ ( x @ X5 )
| ( esk1_0
!= ( f @ X5 ) ) )
& ( ~ ( x @ X6 )
| ( esk1_0
!= ( f @ X6 ) )
| ~ ( y @ X5 )
| ( esk1_0
!= ( f @ X5 ) ) )
& ( ~ ( y @ X7 )
| ( esk1_0
!= ( f @ X7 ) )
| ~ ( y @ X5 )
| ( esk1_0
!= ( f @ X5 ) ) )
& ( ( y @ esk4_0 )
| ( x @ esk3_0 )
| ( x @ esk2_0 )
| ( y @ esk2_0 ) )
& ( ( esk1_0
= ( f @ esk4_0 ) )
| ( x @ esk3_0 )
| ( x @ esk2_0 )
| ( y @ esk2_0 ) )
& ( ( y @ esk4_0 )
| ( esk1_0
= ( f @ esk3_0 ) )
| ( x @ esk2_0 )
| ( y @ esk2_0 ) )
& ( ( esk1_0
= ( f @ esk4_0 ) )
| ( esk1_0
= ( f @ esk3_0 ) )
| ( x @ esk2_0 )
| ( y @ esk2_0 ) )
& ( ( y @ esk4_0 )
| ( x @ esk3_0 )
| ( esk1_0
= ( f @ esk2_0 ) ) )
& ( ( esk1_0
= ( f @ esk4_0 ) )
| ( x @ esk3_0 )
| ( esk1_0
= ( f @ esk2_0 ) ) )
& ( ( y @ esk4_0 )
| ( esk1_0
= ( f @ esk3_0 ) )
| ( esk1_0
= ( f @ esk2_0 ) ) )
& ( ( esk1_0
= ( f @ esk4_0 ) )
| ( esk1_0
= ( f @ esk3_0 ) )
| ( esk1_0
= ( f @ esk2_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,
! [X2: b,X5: b] :
( ~ ( y @ X2 )
| ( esk1_0
!= ( f @ X2 ) )
| ~ ( y @ X5 )
| ( esk1_0
!= ( f @ X5 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X2: b,X5: b] :
( ~ ( x @ X2 )
| ( esk1_0
!= ( f @ X2 ) )
| ~ ( x @ X5 )
| ( esk1_0
!= ( f @ X5 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X2: b] :
( ( ( f @ X2 )
!= esk1_0 )
| ~ ( y @ X2 ) ),
inference(condense,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
( ( y @ esk4_0 )
| ( esk1_0
= ( f @ esk3_0 ) )
| ( esk1_0
= ( f @ esk2_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
( ( esk1_0
= ( f @ esk4_0 ) )
| ( esk1_0
= ( f @ esk3_0 ) )
| ( esk1_0
= ( f @ esk2_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
! [X2: b] :
( ( ( f @ X2 )
!= esk1_0 )
| ~ ( x @ X2 ) ),
inference(condense,[status(thm)],[c_0_4]) ).
thf(c_0_9,negated_conjecture,
( ( y @ esk4_0 )
| ( x @ esk3_0 )
| ( esk1_0
= ( f @ esk2_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
( ( ( f @ esk3_0 )
= esk1_0 )
| ( ( f @ esk2_0 )
= esk1_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
thf(c_0_11,negated_conjecture,
( ( ( f @ esk2_0 )
= esk1_0 )
| ( y @ esk4_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
thf(c_0_12,negated_conjecture,
( ( esk1_0
= ( f @ esk4_0 ) )
| ( x @ esk3_0 )
| ( x @ esk2_0 )
| ( y @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_13,negated_conjecture,
( ( esk1_0
= ( f @ esk4_0 ) )
| ( esk1_0
= ( f @ esk3_0 ) )
| ( x @ esk2_0 )
| ( y @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_14,negated_conjecture,
( ( esk1_0
= ( f @ esk4_0 ) )
| ( x @ esk3_0 )
| ( esk1_0
= ( f @ esk2_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_15,negated_conjecture,
( ( ( f @ esk2_0 )
= esk1_0 )
| ( ( f @ esk4_0 )
!= esk1_0 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
thf(c_0_16,negated_conjecture,
( ( y @ esk4_0 )
| ( x @ esk3_0 )
| ( x @ esk2_0 )
| ( y @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_17,negated_conjecture,
( ( y @ esk4_0 )
| ( esk1_0
= ( f @ esk3_0 ) )
| ( x @ esk2_0 )
| ( y @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_18,negated_conjecture,
( ( ( f @ esk4_0 )
= esk1_0 )
| ( x @ esk2_0 )
| ( y @ esk2_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_12]),c_0_13]) ).
thf(c_0_19,negated_conjecture,
( ( f @ esk2_0 )
= esk1_0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_14]),c_0_10]),c_0_15]) ).
thf(c_0_20,negated_conjecture,
( ( x @ esk2_0 )
| ( y @ esk4_0 )
| ( y @ esk2_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_16]),c_0_17]) ).
thf(c_0_21,negated_conjecture,
( ( ( f @ esk4_0 )
= esk1_0 )
| ( y @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_18]),c_0_19])]) ).
thf(c_0_22,negated_conjecture,
( ( y @ esk2_0 )
| ( y @ esk4_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_20]),c_0_19])]) ).
thf(c_0_23,negated_conjecture,
( ( f @ esk4_0 )
= esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_21]),c_0_19])]) ).
thf(c_0_24,negated_conjecture,
y @ esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_22]),c_0_23])]) ).
thf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_24]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU895^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.12/0.35 % Computer : n024.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Sun May 19 17:29:22 EDT 2024
% 0.12/0.36 % CPUTime :
% 0.19/0.48 Running higher-order theorem proving
% 0.19/0.48 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: HSSSSMSSSSSNSSN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.19/0.50 # Starting post_as_ho10 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # post_as_ho10 with pid 19822 completed with status 0
% 0.19/0.50 # Result found by post_as_ho10
% 0.19/0.50 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.19/0.50 # Starting post_as_ho10 with 300s (1) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: HGHSF-FFSM11-SSSFFFNN
% 0.19/0.50 # partial match(1): HGHSF-FFSF11-SSSFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.50 # new_ho_10 with pid 19825 completed with status 0
% 0.19/0.50 # Result found by new_ho_10
% 0.19/0.50 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.19/0.50 # Starting post_as_ho10 with 300s (1) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: HGHSF-FFSM11-SSSFFFNN
% 0.19/0.50 # partial match(1): HGHSF-FFSF11-SSSFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting new_ho_10 with 163s (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 : 6
% 0.19/0.50 # Removed by relevancy pruning/SinE : 0
% 0.19/0.50 # Initial clauses : 17
% 0.19/0.50 # Removed in clause preprocessing : 5
% 0.19/0.50 # Initial clauses in saturation : 12
% 0.19/0.50 # Processed clauses : 32
% 0.19/0.50 # ...of these trivial : 0
% 0.19/0.50 # ...subsumed : 2
% 0.19/0.50 # ...remaining for further processing : 30
% 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 : 9
% 0.19/0.50 # Backward-rewritten : 6
% 0.19/0.50 # Generated clauses : 13
% 0.19/0.50 # ...of the previous two non-redundant : 12
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 6
% 0.19/0.50 # Paramodulations : 13
% 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 : 11
% 0.19/0.50 # ...of those cached : 8
% 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 : 5
% 0.19/0.50 # Positive orientable unit clauses : 3
% 0.19/0.50 # Positive unorientable unit clauses: 0
% 0.19/0.50 # Negative unit clauses : 0
% 0.19/0.50 # Non-unit-clauses : 2
% 0.19/0.50 # Current number of unprocessed clauses: 0
% 0.19/0.50 # ...number of literals in the above : 0
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 25
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 47
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 22
% 0.19/0.50 # Non-unit clause-clause subsumptions : 19
% 0.19/0.50 # Unit Clause-clause subsumption calls : 3
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 3
% 0.19/0.50 # BW rewrite match successes : 3
% 0.19/0.50 # Condensation attempts : 32
% 0.19/0.50 # Condensation successes : 2
% 0.19/0.50 # Termbank termtop insertions : 985
% 0.19/0.50 # Search garbage collected termcells : 184
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.005 s
% 0.19/0.50 # System time : 0.000 s
% 0.19/0.50 # Total time : 0.005 s
% 0.19/0.50 # Maximum resident set size: 1768 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.006 s
% 0.19/0.50 # System time : 0.002 s
% 0.19/0.50 # Total time : 0.008 s
% 0.19/0.50 # Maximum resident set size: 1716 pages
% 0.19/0.50 % E---3.1 exiting
% 0.19/0.50 % E exiting
%------------------------------------------------------------------------------