TSTP Solution File: SEV433^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV433^1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:08:23 EDT 2024
% Result : Theorem 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 5 unt; 4 typ; 0 def)
% Number of atoms : 52 ( 32 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 65 ( 13 ~; 28 |; 3 &; 19 @)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 28 ( 0 ^ 28 !; 0 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
f: $i > $o ).
thf(decl_23,type,
esk1_0: $i ).
thf(decl_24,type,
esk2_0: $i ).
thf(decl_25,type,
esk3_0: $i ).
thf(finj,axiom,
! [X1: $i,X2: $i] :
( ( ( f @ X1 )
<=> ( f @ X2 ) )
=> ( X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',finj) ).
thf(less3,conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( X1 = X2 )
| ( X1 = X3 )
| ( X2 = X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less3) ).
thf(c_0_2,plain,
! [X9: $i,X10: $i] :
( ( ~ ( f @ X9 )
| ~ ( f @ X10 )
| ( X9 = X10 ) )
& ( ( f @ X9 )
| ( f @ X10 )
| ( X9 = X10 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[finj])])])]) ).
thf(c_0_3,plain,
! [X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ ( f @ X1 )
| ~ ( f @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,plain,
! [X1: $i,X2: $i] :
( ( f @ X1 )
| ( f @ X2 )
| ( X1 = X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
~ ! [X1: $i,X2: $i,X3: $i] :
( ( X1 = X2 )
| ( X1 = X3 )
| ( X2 = X3 ) ),
inference(assume_negation,[status(cth)],[less3]) ).
thf(c_0_6,plain,
! [X1: $i,X2: $i,X3: $i] :
( ( X1 = X2 )
| ( X3 = X1 )
| ( f @ X2 )
| ~ ( f @ X3 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_7,negated_conjecture,
( ( esk1_0 != esk2_0 )
& ( esk1_0 != esk3_0 )
& ( esk2_0 != esk3_0 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
thf(c_0_8,plain,
! [X3: $i,X2: $i,X1: $i,X4: $i] :
( ( X1 = X2 )
| ( X1 = X3 )
| ( X3 = X4 )
| ( f @ X2 )
| ( f @ X4 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_4]) ).
thf(c_0_9,negated_conjecture,
esk1_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,plain,
! [X1: $i,X3: $i,X2: $i] :
( ( X1 = X2 )
| ( X3 = X1 )
| ( X3 = X2 )
| ( f @ X2 ) ),
inference(ef,[status(thm)],[c_0_8]) ).
thf(c_0_11,negated_conjecture,
esk2_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i] :
( ( esk1_0 = X1 )
| ( X1 = esk3_0 )
| ( f @ esk3_0 ) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10])]) ).
thf(c_0_13,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_14,negated_conjecture,
f @ esk3_0,
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12])]),c_0_13]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i] :
( ( X1 = esk3_0 )
| ~ ( f @ X1 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_14]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i] :
( ( esk2_0 = X1 )
| ( X1 = esk1_0 )
| ( f @ esk1_0 ) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_10])]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i] :
( ( X1 = esk1_0 )
| ( esk2_0 = X1 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_9]) ).
thf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_17]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEV433^1 : TPTP v8.2.0. Released v5.2.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n017.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 19:07:38 EDT 2024
% 0.13/0.34 % 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.49 # Version: 3.1.0-ho
% 0.19/0.49 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.49 # Starting ho_unfolding_6 with 300s (1) cores
% 0.19/0.49 # Starting sh4l with 300s (1) cores
% 0.19/0.49 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.19/0.49 # ehoh_best_nonlift_rwall with pid 12505 completed with status 0
% 0.19/0.49 # Result found by ehoh_best_nonlift_rwall
% 0.19/0.49 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.49 # Starting ho_unfolding_6 with 300s (1) cores
% 0.19/0.49 # Starting sh4l with 300s (1) cores
% 0.19/0.49 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.19/0.49 # No SInE strategy applied
% 0.19/0.49 # Search class: HGUSF-FFSF00-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting new_ho_10 with 181s (1) cores
% 0.19/0.49 # new_ho_10 with pid 12507 completed with status 0
% 0.19/0.49 # Result found by new_ho_10
% 0.19/0.49 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.49 # Starting ho_unfolding_6 with 300s (1) cores
% 0.19/0.49 # Starting sh4l with 300s (1) cores
% 0.19/0.49 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.19/0.49 # No SInE strategy applied
% 0.19/0.49 # Search class: HGUSF-FFSF00-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting new_ho_10 with 181s (1) cores
% 0.19/0.49 # Preprocessing time : 0.001 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Theorem
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 3
% 0.19/0.49 # Removed by relevancy pruning/SinE : 0
% 0.19/0.49 # Initial clauses : 6
% 0.19/0.49 # Removed in clause preprocessing : 1
% 0.19/0.49 # Initial clauses in saturation : 5
% 0.19/0.49 # Processed clauses : 34
% 0.19/0.49 # ...of these trivial : 1
% 0.19/0.49 # ...subsumed : 11
% 0.19/0.49 # ...remaining for further processing : 22
% 0.19/0.49 # Other redundant clauses eliminated : 101
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 2
% 0.19/0.49 # Backward-rewritten : 0
% 0.19/0.49 # Generated clauses : 390
% 0.19/0.49 # ...of the previous two non-redundant : 208
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 2
% 0.19/0.49 # Paramodulations : 157
% 0.19/0.49 # Factorizations : 132
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 101
% 0.19/0.49 # Disequality decompositions : 0
% 0.19/0.49 # Total rewrite steps : 13
% 0.19/0.49 # ...of those cached : 12
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 15
% 0.19/0.49 # Positive orientable unit clauses : 1
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 3
% 0.19/0.49 # Non-unit-clauses : 11
% 0.19/0.49 # Current number of unprocessed clauses: 181
% 0.19/0.49 # ...number of literals in the above : 1005
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 7
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 196
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 130
% 0.19/0.49 # Non-unit clause-clause subsumptions : 15
% 0.19/0.49 # Unit Clause-clause subsumption calls : 1
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 1
% 0.19/0.49 # BW rewrite match successes : 1
% 0.19/0.49 # Condensation attempts : 34
% 0.19/0.49 # Condensation successes : 1
% 0.19/0.49 # Termbank termtop insertions : 1792
% 0.19/0.49 # Search garbage collected termcells : 91
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.011 s
% 0.19/0.49 # System time : 0.001 s
% 0.19/0.49 # Total time : 0.012 s
% 0.19/0.49 # Maximum resident set size: 1588 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.011 s
% 0.19/0.49 # System time : 0.004 s
% 0.19/0.49 # Total time : 0.015 s
% 0.19/0.49 # Maximum resident set size: 1696 pages
% 0.19/0.49 % E---3.1 exiting
% 0.19/0.49 % E exiting
%------------------------------------------------------------------------------