TSTP Solution File: SYO227^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO227^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 08:45:12 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 15 ( 5 unt; 4 typ; 0 def)
% Number of atoms : 21 ( 7 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 74 ( 14 ~; 7 |; 9 &; 38 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 13 ( 0 ^ 11 !; 2 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
c: $i ).
thf(decl_23,type,
b: $i ).
thf(decl_24,type,
a: $i ).
thf(decl_25,type,
c_less_: $i > $i > $o ).
thf(cBLEDSOE4_W_AX,conjecture,
( ! [X1: $i,X2: $i] :
( ( c_less_ @ X1 @ X2 )
=> ( X1 != X2 ) )
=> ( ( ( c_less_ @ a @ b )
& ( c_less_ @ b @ c ) )
=> ? [X3: $i > $o] :
( ~ ( X3 @ a )
& ( X3 @ b )
& ~ ( X3 @ c ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBLEDSOE4_W_AX) ).
thf(c_0_1,negated_conjecture,
~ ( ! [X1: $i,X2: $i] :
( ( c_less_ @ X1 @ X2 )
=> ( X1 != X2 ) )
=> ( ( ( c_less_ @ a @ b )
& ( c_less_ @ b @ c ) )
=> ? [X3: $i > $o] :
( ~ ( X3 @ a )
& ( X3 @ b )
& ~ ( X3 @ c ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cBLEDSOE4_W_AX])]) ).
thf(c_0_2,negated_conjecture,
! [X7: $i,X8: $i,X9: $i > $o] :
( ( ~ ( c_less_ @ X7 @ X8 )
| ( X7 != X8 ) )
& ( c_less_ @ a @ b )
& ( c_less_ @ b @ c )
& ( ( X9 @ a )
| ~ ( X9 @ b )
| ( X9 @ c ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).
thf(c_0_3,negated_conjecture,
! [X3: $i > $o] :
( ( X3 @ a )
| ( X3 @ c )
| ~ ( X3 @ b ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: $i,X2: $i] :
( ~ ( c_less_ @ X1 @ X2 )
| ( X1 != X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
c_less_ @ a @ b,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
( ( a = b )
| ( c = b ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_3]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i] :
~ ( c_less_ @ X1 @ X1 ),
inference(er,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
c_less_ @ b @ c,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
c = b,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
thf(c_0_10,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO227^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n014.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 08:44:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running higher-order theorem proving
% 0.20/0.49 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.20/0.50 # Version: 3.1.0-ho
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.20/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.20/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.50 # Starting post_as_ho4 with 300s (1) cores
% 0.20/0.50 # Starting post_as_ho2 with 300s (1) cores
% 0.20/0.50 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.50 # Starting full_lambda_10 with 300s (1) cores
% 0.20/0.50 # Starting new_ho_8 with 300s (1) cores
% 0.20/0.50 # post_as_ho12 with pid 10693 completed with status 0
% 0.20/0.50 # Result found by post_as_ho12
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.20/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HGHSF-FFSF00-SSSFFSBN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting ho_unfolding_3 with 163s (1) cores
% 0.20/0.50 # ho_unfolding_3 with pid 10701 completed with status 0
% 0.20/0.50 # Result found by ho_unfolding_3
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.20/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HGHSF-FFSF00-SSSFFSBN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting ho_unfolding_3 with 163s (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 : 5
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 8
% 0.20/0.50 # Removed in clause preprocessing : 4
% 0.20/0.50 # Initial clauses in saturation : 4
% 0.20/0.50 # Processed clauses : 14
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 0
% 0.20/0.50 # ...remaining for further processing : 14
% 0.20/0.50 # Other redundant clauses eliminated : 1
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 6
% 0.20/0.50 # Generated clauses : 8
% 0.20/0.50 # ...of the previous two non-redundant : 6
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 4
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 1
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 7
% 0.20/0.50 # ...of those cached : 4
% 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 : 3
% 0.20/0.50 # Positive orientable unit clauses : 2
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 1
% 0.20/0.50 # Non-unit-clauses : 0
% 0.20/0.50 # Current number of unprocessed clauses: 0
% 0.20/0.50 # ...number of literals in the above : 0
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 10
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 2
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 2
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 0
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 1
% 0.20/0.50 # BW rewrite match successes : 1
% 0.20/0.50 # Condensation attempts : 14
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 489
% 0.20/0.50 # Search garbage collected termcells : 114
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.003 s
% 0.20/0.50 # System time : 0.001 s
% 0.20/0.50 # Total time : 0.004 s
% 0.20/0.50 # Maximum resident set size: 1732 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.004 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.007 s
% 0.20/0.50 # Maximum resident set size: 1700 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.51 % E exiting
%------------------------------------------------------------------------------