TSTP Solution File: SYO272^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO272^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:19 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 22 ( 6 unt; 9 typ; 0 def)
% Number of atoms : 40 ( 0 equ; 0 cnn)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 285 ( 21 ~; 22 |; 17 &; 213 @)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 10 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 33 ( 33 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 9 usr; 4 con; 0-4 aty)
% Number of variables : 41 ( 4 ^ 37 !; 0 ?; 41 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
cHALF: $i > $i > $o ).
thf(decl_23,type,
cDOUBLE: $i > $i > $o ).
thf(decl_24,type,
cS: $i > $i ).
thf(decl_25,type,
c0: $i ).
thf(decl_26,type,
esk1_3: $i > $i > ( $i > $i > $o ) > $i ).
thf(decl_27,type,
esk2_3: $i > $i > ( $i > $i > $o ) > $i ).
thf(decl_28,type,
epred1_2: $i > $i > $i > $i > $o ).
thf(decl_29,type,
esk3_0: $i ).
thf(decl_30,type,
esk4_0: $i ).
thf(cTHM301A,conjecture,
( ( ! [X1: $i,X2: $i] :
( ( cDOUBLE @ X1 @ X2 )
<=> ! [X3: $i > $i > $o] :
( ( ( X3 @ c0 @ c0 )
& ! [X4: $i,X5: $i] :
( ( X3 @ X4 @ X5 )
=> ( X3 @ ( cS @ X4 ) @ ( cS @ ( cS @ X5 ) ) ) ) )
=> ( X3 @ X1 @ X2 ) ) )
& ( cHALF @ c0 @ c0 )
& ( cHALF @ ( cS @ c0 ) @ c0 )
& ! [X4: $i,X5: $i] :
( ( cHALF @ X4 @ X5 )
=> ( cHALF @ ( cS @ ( cS @ X4 ) ) @ ( cS @ X5 ) ) ) )
=> ! [X1: $i,X2: $i] :
( ( cDOUBLE @ X1 @ X2 )
=> ( cHALF @ X2 @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM301A) ).
thf(c_0_1,negated_conjecture,
~ ( ( ! [X1: $i,X2: $i] :
( ( cDOUBLE @ X1 @ X2 )
<=> ! [X3: $i > $i > $o] :
( ( ( X3 @ c0 @ c0 )
& ! [X4: $i,X5: $i] :
( ( X3 @ X4 @ X5 )
=> ( X3 @ ( cS @ X4 ) @ ( cS @ ( cS @ X5 ) ) ) ) )
=> ( X3 @ X1 @ X2 ) ) )
& ( cHALF @ c0 @ c0 )
& ( cHALF @ ( cS @ c0 ) @ c0 )
& ! [X4: $i,X5: $i] :
( ( cHALF @ X4 @ X5 )
=> ( cHALF @ ( cS @ ( cS @ X4 ) ) @ ( cS @ X5 ) ) ) )
=> ! [X1: $i,X2: $i] :
( ( cDOUBLE @ X1 @ X2 )
=> ( cHALF @ X2 @ X1 ) ) ),
inference(assume_negation,[status(cth)],[cTHM301A]) ).
thf(c_0_2,negated_conjecture,
! [X15: $i,X16: $i,X17: $i > $i > $o,X20: $i,X21: $i,X23: $i,X24: $i,X25: $i,X26: $i] :
( ( ( X17 @ ( esk1_3 @ X15 @ X16 @ X17 ) @ ( esk2_3 @ X15 @ X16 @ X17 ) )
| ~ ( X17 @ c0 @ c0 )
| ( X17 @ X15 @ X16 )
| ~ ( cDOUBLE @ X15 @ X16 ) )
& ( ~ ( X17 @ ( cS @ ( esk1_3 @ X15 @ X16 @ X17 ) ) @ ( cS @ ( cS @ ( esk2_3 @ X15 @ X16 @ X17 ) ) ) )
| ~ ( X17 @ c0 @ c0 )
| ( X17 @ X15 @ X16 )
| ~ ( cDOUBLE @ X15 @ X16 ) )
& ( ( epred1_2 @ X20 @ X21 @ c0 @ c0 )
| ( cDOUBLE @ X20 @ X21 ) )
& ( ~ ( epred1_2 @ X20 @ X21 @ X23 @ X24 )
| ( epred1_2 @ X20 @ X21 @ ( cS @ X23 ) @ ( cS @ ( cS @ X24 ) ) )
| ( cDOUBLE @ X20 @ X21 ) )
& ( ~ ( epred1_2 @ X20 @ X21 @ X20 @ X21 )
| ( cDOUBLE @ X20 @ X21 ) )
& ( cHALF @ c0 @ c0 )
& ( cHALF @ ( cS @ c0 ) @ c0 )
& ( ~ ( cHALF @ X25 @ X26 )
| ( cHALF @ ( cS @ ( cS @ X25 ) ) @ ( cS @ X26 ) ) )
& ( cDOUBLE @ esk3_0 @ esk4_0 )
& ~ ( cHALF @ esk4_0 @ esk3_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(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X1: $i,X3: $i > $i > $o,X2: $i] :
( ( X3 @ X1 @ X2 )
| ~ ( X3 @ ( cS @ ( esk1_3 @ X1 @ X2 @ X3 ) ) @ ( cS @ ( cS @ ( esk2_3 @ X1 @ X2 @ X3 ) ) ) )
| ~ ( X3 @ c0 @ c0 )
| ~ ( cDOUBLE @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
cDOUBLE @ esk3_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X1: $i,X3: $i > $i > $o,X2: $i] :
( ( X3 @ ( esk1_3 @ X1 @ X2 @ X3 ) @ ( esk2_3 @ X1 @ X2 @ X3 ) )
| ( X3 @ X1 @ X2 )
| ~ ( X3 @ c0 @ c0 )
| ~ ( cDOUBLE @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X3: $i > $i > $o] :
( ( X3 @ esk3_0 @ esk4_0 )
| ~ ( X3 @ ( cS @ ( esk1_3 @ esk3_0 @ esk4_0 @ X3 ) ) @ ( cS @ ( cS @ ( esk2_3 @ esk3_0 @ esk4_0 @ X3 ) ) ) )
| ~ ( X3 @ c0 @ c0 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i,X2: $i] :
( ( cHALF @ ( cS @ ( cS @ X1 ) ) @ ( cS @ X2 ) )
| ~ ( cHALF @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
cHALF @ c0 @ c0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
~ ( cHALF @ esk4_0 @ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
! [X3: $i > $i > $o] :
( ( X3 @ ( esk1_3 @ esk3_0 @ esk4_0 @ X3 ) @ ( esk2_3 @ esk3_0 @ esk4_0 @ X3 ) )
| ( X3 @ esk3_0 @ esk4_0 )
| ~ ( X3 @ c0 @ c0 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
thf(c_0_11,negated_conjecture,
~ ( cHALF
@ ( esk2_3 @ esk3_0 @ esk4_0
@ ^ [Z0: $i,Z1: $i] : ( cHALF @ Z1 @ Z0 ) )
@ ( esk1_3 @ esk3_0 @ esk4_0
@ ^ [Z0: $i,Z1: $i] : ( cHALF @ Z1 @ Z0 ) ) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]),c_0_9]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_8]),c_0_9]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO272^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n006.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 09:08:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 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: 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 29493 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: HGUNF-FFSS32-MSSFFSBN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting post_as_ho12 with 181s (1) cores
% 0.20/0.50 # post_as_ho12 with pid 29502 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: HGUNF-FFSS32-MSSFFSBN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting post_as_ho12 with 181s (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 : 14
% 0.20/0.50 # Removed in clause preprocessing : 4
% 0.20/0.50 # Initial clauses in saturation : 10
% 0.20/0.50 # Processed clauses : 31
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 0
% 0.20/0.50 # ...remaining for further processing : 30
% 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 : 55
% 0.20/0.50 # ...of the previous two non-redundant : 42
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 45
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 4
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 6
% 0.20/0.50 # ...of those cached : 3
% 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 : 20
% 0.20/0.50 # Positive orientable unit clauses : 5
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 2
% 0.20/0.50 # Non-unit-clauses : 13
% 0.20/0.50 # Current number of unprocessed clauses: 31
% 0.20/0.50 # ...number of literals in the above : 82
% 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) : 5
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 5
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 1
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 0
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 10054
% 0.20/0.50 # Search garbage collected termcells : 366
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.008 s
% 0.20/0.50 # System time : 0.002 s
% 0.20/0.50 # Total time : 0.010 s
% 0.20/0.50 # Maximum resident set size: 1688 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.009 s
% 0.20/0.50 # System time : 0.005 s
% 0.20/0.50 # Total time : 0.014 s
% 0.20/0.50 # Maximum resident set size: 1720 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------