TSTP Solution File: SYO224^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO224^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:11 EDT 2024
% Result : Theorem 1.40s 0.67s
% Output : CNFRefutation 1.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 35 ( 9 unt; 8 typ; 0 def)
% Number of atoms : 114 ( 7 equ; 0 cnn)
% Maximal formula atoms : 33 ( 4 avg)
% Number of connectives : 393 ( 63 ~; 86 |; 29 &; 205 @)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 19 ( 19 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 33 ( 4 ^ 25 !; 4 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
cJ: $i ).
thf(decl_23,type,
cLIKE: $i > $i > $o ).
thf(decl_24,type,
cWRH: $i > $o ).
thf(decl_25,type,
cW: $i > $o ).
thf(decl_26,type,
cUNIQUE: $i > $o ).
thf(decl_27,type,
cS: $i ).
thf(decl_28,type,
cP: $i ).
thf(decl_29,type,
esk1_1: ( $i > $o ) > $i ).
thf(cLING1,conjecture,
( ( ! [X1: $i] :
( ( cUNIQUE @ X1 )
=> ! [X2: $i] :
( ( ( cWRH @ X2 )
& ( cW @ X2 ) )
=> ( X1 = X2 ) ) )
& ( cUNIQUE @ cS )
& ( cW @ cS )
& ( cWRH @ cS ) )
=> ? [X3: $i > $o] :
( ( ( X3 @ cP )
<=> ( cLIKE @ cP @ cS ) )
& ( ( X3 @ cJ )
<=> ? [X1: $i] :
( ( cUNIQUE @ X1 )
& ( cW @ X1 )
& ( cWRH @ X1 )
& ( cLIKE @ cJ @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cLING1) ).
thf(c_0_1,negated_conjecture,
~ ( ( ! [X1: $i] :
( ( cUNIQUE @ X1 )
=> ! [X2: $i] :
( ( ( cWRH @ X2 )
& ( cW @ X2 ) )
=> ( X1 = X2 ) ) )
& ( cUNIQUE @ cS )
& ( cW @ cS )
& ( cWRH @ cS ) )
=> ? [X3: $i > $o] :
( ( ( X3 @ cP )
<=> ( cLIKE @ cP @ cS ) )
& ( ( X3 @ cJ )
<=> ? [X1: $i] :
( ( cUNIQUE @ X1 )
& ( cW @ X1 )
& ( cWRH @ X1 )
& ( cLIKE @ cJ @ X1 ) ) ) ) ),
inference(assume_negation,[status(cth)],[cLING1]) ).
thf(c_0_2,negated_conjecture,
! [X8: $i,X9: $i,X10: $i > $o,X11: $i] :
( ( ~ ( cUNIQUE @ X8 )
| ~ ( cWRH @ X9 )
| ~ ( cW @ X9 )
| ( X8 = X9 ) )
& ( cUNIQUE @ cS )
& ( cW @ cS )
& ( cWRH @ cS )
& ( ~ ( X10 @ cJ )
| ~ ( cUNIQUE @ X11 )
| ~ ( cW @ X11 )
| ~ ( cWRH @ X11 )
| ~ ( cLIKE @ cJ @ X11 )
| ~ ( X10 @ cP )
| ~ ( cLIKE @ cP @ cS ) )
& ( ( cUNIQUE @ ( esk1_1 @ X10 ) )
| ( X10 @ cJ )
| ~ ( X10 @ cP )
| ~ ( cLIKE @ cP @ cS ) )
& ( ( cW @ ( esk1_1 @ X10 ) )
| ( X10 @ cJ )
| ~ ( X10 @ cP )
| ~ ( cLIKE @ cP @ cS ) )
& ( ( cWRH @ ( esk1_1 @ X10 ) )
| ( X10 @ cJ )
| ~ ( X10 @ cP )
| ~ ( cLIKE @ cP @ cS ) )
& ( ( cLIKE @ cJ @ ( esk1_1 @ X10 ) )
| ( X10 @ cJ )
| ~ ( X10 @ cP )
| ~ ( cLIKE @ cP @ cS ) )
& ( ~ ( X10 @ cJ )
| ~ ( cUNIQUE @ X11 )
| ~ ( cW @ X11 )
| ~ ( cWRH @ X11 )
| ~ ( cLIKE @ cJ @ X11 )
| ( X10 @ cP )
| ( cLIKE @ cP @ cS ) )
& ( ( cUNIQUE @ ( esk1_1 @ X10 ) )
| ( X10 @ cJ )
| ( X10 @ cP )
| ( cLIKE @ cP @ cS ) )
& ( ( cW @ ( esk1_1 @ X10 ) )
| ( X10 @ cJ )
| ( X10 @ cP )
| ( cLIKE @ cP @ cS ) )
& ( ( cWRH @ ( esk1_1 @ X10 ) )
| ( X10 @ cJ )
| ( X10 @ cP )
| ( cLIKE @ cP @ cS ) )
& ( ( cLIKE @ cJ @ ( esk1_1 @ X10 ) )
| ( X10 @ cJ )
| ( X10 @ cP )
| ( cLIKE @ cP @ cS ) ) ),
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,
! [X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ ( cUNIQUE @ X1 )
| ~ ( cWRH @ X2 )
| ~ ( cW @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
cW @ cS,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
cWRH @ cS,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X3: $i > $o] :
( ( cUNIQUE @ ( esk1_1 @ X3 ) )
| ( X3 @ cJ )
| ( X3 @ cP )
| ( cLIKE @ cP @ cS ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i,X3: $i > $o] :
( ~ ( X3 @ cJ )
| ~ ( cUNIQUE @ X1 )
| ~ ( cW @ X1 )
| ~ ( cWRH @ X1 )
| ~ ( cLIKE @ cJ @ X1 )
| ~ ( X3 @ cP )
| ~ ( cLIKE @ cP @ cS ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i] :
( ( X1 = cS )
| ~ ( cUNIQUE @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5])]) ).
thf(c_0_9,negated_conjecture,
( ( cUNIQUE
@ ( esk1_1
@ ^ [Z0: $i] : ~ $true ) )
| ( cLIKE @ cP @ cS ) ),
inference(primitive_enumeration,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
! [X3: $i > $o,X1: $i] :
( ( X3 @ cP )
| ( cLIKE @ cP @ cS )
| ~ ( X3 @ cJ )
| ~ ( cUNIQUE @ X1 )
| ~ ( cW @ X1 )
| ~ ( cWRH @ X1 )
| ~ ( cLIKE @ cJ @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i] :
( ~ ( cLIKE @ cP @ cS )
| ~ ( cLIKE @ cJ @ X1 )
| ~ ( cWRH @ X1 )
| ~ ( cW @ X1 )
| ~ ( cUNIQUE @ X1 ) ),
inference(primitive_enumeration,[status(thm)],[c_0_7]) ).
thf(c_0_12,negated_conjecture,
! [X3: $i > $o] :
( ( cLIKE @ cJ @ ( esk1_1 @ X3 ) )
| ( X3 @ cJ )
| ( X3 @ cP )
| ( cLIKE @ cP @ cS ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_13,negated_conjecture,
( ( ( esk1_1
@ ^ [Z0: $i] : ~ $true )
= cS )
| ( cLIKE @ cP @ cS ) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X3: $i > $o] :
( ( X3 @ cP )
| ~ ( cLIKE @ cJ @ X1 )
| ~ ( cWRH @ X1 )
| ~ ( cW @ X1 )
| ~ ( cUNIQUE @ X1 )
| ~ ( X3 @ cJ ) ),
inference(csr,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_15,negated_conjecture,
( ( cLIKE @ cP @ cS )
| ( cLIKE @ cJ @ cS ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i] :
( ~ ( cLIKE @ cJ @ X1 )
| ~ ( cWRH @ X1 )
| ~ ( cW @ X1 )
| ~ ( cUNIQUE @ X1 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_11]) ).
thf(c_0_17,negated_conjecture,
cUNIQUE @ cS,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_18,negated_conjecture,
~ ( cLIKE @ cJ @ cS ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_5]),c_0_4])]) ).
thf(c_0_19,negated_conjecture,
! [X3: $i > $o] :
( ( cUNIQUE @ ( esk1_1 @ X3 ) )
| ( X3 @ cJ )
| ~ ( X3 @ cP )
| ~ ( cLIKE @ cP @ cS ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_20,negated_conjecture,
cLIKE @ cP @ cS,
inference(sr,[status(thm)],[c_0_15,c_0_18]) ).
thf(c_0_21,negated_conjecture,
! [X3: $i > $o] :
( ( cUNIQUE @ ( esk1_1 @ X3 ) )
| ( X3 @ cJ )
| ~ ( X3 @ cP ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).
thf(c_0_22,negated_conjecture,
! [X3: $i > $o] :
( ( cLIKE @ cJ @ ( esk1_1 @ X3 ) )
| ( X3 @ cJ )
| ~ ( X3 @ cP )
| ~ ( cLIKE @ cP @ cS ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_23,negated_conjecture,
( cUNIQUE
@ ( esk1_1
@ ^ [Z0: $i] : ( cLIKE @ Z0 @ cS ) ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_20]),c_0_18]) ).
thf(c_0_24,negated_conjecture,
! [X3: $i > $o] :
( ( cLIKE @ cJ @ ( esk1_1 @ X3 ) )
| ( X3 @ cJ )
| ~ ( X3 @ cP ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_20])]) ).
thf(c_0_25,negated_conjecture,
( ( esk1_1
@ ^ [Z0: $i] : ( cLIKE @ Z0 @ cS ) )
= cS ),
inference(spm,[status(thm)],[c_0_8,c_0_23]) ).
thf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_20]),c_0_18]),c_0_25]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO224^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n022.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 : Mon May 20 09:20:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.48 Running higher-order theorem proving
% 0.19/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
% 1.40/0.67 # Version: 3.1.0-ho
% 1.40/0.67 # Preprocessing class: HSSSSMSSSSSNSSA.
% 1.40/0.67 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 1.40/0.67 # Starting post_as_ho12 with 300s (1) cores
% 1.40/0.67 # Starting new_bool_9 with 300s (1) cores
% 1.40/0.67 # Starting post_as_ho1 with 300s (1) cores
% 1.40/0.67 # Starting post_as_ho4 with 300s (1) cores
% 1.40/0.67 # Starting post_as_ho2 with 300s (1) cores
% 1.40/0.67 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 1.40/0.67 # Starting full_lambda_10 with 300s (1) cores
% 1.40/0.67 # Starting new_ho_8 with 300s (1) cores
% 1.40/0.67 # post_as_ho4 with pid 2534 completed with status 0
% 1.40/0.67 # Result found by post_as_ho4
% 1.40/0.67 # Preprocessing class: HSSSSMSSSSSNSSA.
% 1.40/0.67 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 1.40/0.67 # Starting post_as_ho12 with 300s (1) cores
% 1.40/0.67 # Starting new_bool_9 with 300s (1) cores
% 1.40/0.67 # Starting post_as_ho1 with 300s (1) cores
% 1.40/0.67 # Starting post_as_ho4 with 300s (1) cores
% 1.40/0.67 # No SInE strategy applied
% 1.40/0.67 # Search class: HGHSF-FFSS11-SSSFFMBN
% 1.40/0.67 # partial match(1): HGHSF-FFSF11-SSSFFMBN
% 1.40/0.67 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.40/0.67 # Starting ho_unfolding_6 with 163s (1) cores
% 1.40/0.67 # ho_unfolding_6 with pid 2543 completed with status 9
% 1.40/0.67 # Starting post_as_ho4 with 31s (1) cores
% 1.40/0.67 # post_as_ho4 with pid 2628 completed with status 0
% 1.40/0.67 # Result found by post_as_ho4
% 1.40/0.67 # Preprocessing class: HSSSSMSSSSSNSSA.
% 1.40/0.67 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 1.40/0.67 # Starting post_as_ho12 with 300s (1) cores
% 1.40/0.67 # Starting new_bool_9 with 300s (1) cores
% 1.40/0.67 # Starting post_as_ho1 with 300s (1) cores
% 1.40/0.67 # Starting post_as_ho4 with 300s (1) cores
% 1.40/0.67 # No SInE strategy applied
% 1.40/0.67 # Search class: HGHSF-FFSS11-SSSFFMBN
% 1.40/0.67 # partial match(1): HGHSF-FFSF11-SSSFFMBN
% 1.40/0.67 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.40/0.67 # Starting ho_unfolding_6 with 163s (1) cores
% 1.40/0.67 # ho_unfolding_6 with pid 2543 completed with status 9
% 1.40/0.67 # Starting post_as_ho4 with 31s (1) cores
% 1.40/0.67 # Preprocessing time : 0.001 s
% 1.40/0.67 # Presaturation interreduction done
% 1.40/0.67
% 1.40/0.67 # Proof found!
% 1.40/0.67 # SZS status Theorem
% 1.40/0.67 # SZS output start CNFRefutation
% See solution above
% 1.40/0.67 # Parsed axioms : 8
% 1.40/0.67 # Removed by relevancy pruning/SinE : 0
% 1.40/0.67 # Initial clauses : 21
% 1.40/0.67 # Removed in clause preprocessing : 7
% 1.40/0.67 # Initial clauses in saturation : 14
% 1.40/0.67 # Processed clauses : 60
% 1.40/0.67 # ...of these trivial : 2
% 1.40/0.67 # ...subsumed : 3
% 1.40/0.67 # ...remaining for further processing : 54
% 1.40/0.67 # Other redundant clauses eliminated : 0
% 1.40/0.67 # Clauses deleted for lack of memory : 0
% 1.40/0.67 # Backward-subsumed : 7
% 1.40/0.67 # Backward-rewritten : 18
% 1.40/0.67 # Generated clauses : 315
% 1.40/0.67 # ...of the previous two non-redundant : 138
% 1.40/0.67 # ...aggressively subsumed : 0
% 1.40/0.67 # Contextual simplify-reflections : 2
% 1.40/0.67 # Paramodulations : 241
% 1.40/0.67 # Factorizations : 0
% 1.40/0.67 # NegExts : 0
% 1.40/0.67 # Equation resolutions : 11
% 1.40/0.67 # Disequality decompositions : 0
% 1.40/0.67 # Total rewrite steps : 75
% 1.40/0.67 # ...of those cached : 70
% 1.40/0.67 # Propositional unsat checks : 0
% 1.40/0.67 # Propositional check models : 0
% 1.40/0.67 # Propositional check unsatisfiable : 0
% 1.40/0.67 # Propositional clauses : 0
% 1.40/0.67 # Propositional clauses after purity: 0
% 1.40/0.67 # Propositional unsat core size : 0
% 1.40/0.67 # Propositional preprocessing time : 0.000
% 1.40/0.67 # Propositional encoding time : 0.000
% 1.40/0.67 # Propositional solver time : 0.000
% 1.40/0.67 # Success case prop preproc time : 0.000
% 1.40/0.67 # Success case prop encoding time : 0.000
% 1.40/0.67 # Success case prop solver time : 0.000
% 1.40/0.67 # Current number of processed clauses : 14
% 1.40/0.67 # Positive orientable unit clauses : 5
% 1.40/0.67 # Positive unorientable unit clauses: 0
% 1.40/0.67 # Negative unit clauses : 1
% 1.40/0.67 # Non-unit-clauses : 8
% 1.40/0.67 # Current number of unprocessed clauses: 100
% 1.40/0.67 # ...number of literals in the above : 524
% 1.40/0.67 # Current number of archived formulas : 0
% 1.40/0.67 # Current number of archived clauses : 40
% 1.40/0.67 # Clause-clause subsumption calls (NU) : 123
% 1.40/0.67 # Rec. Clause-clause subsumption calls : 21
% 1.40/0.67 # Non-unit clause-clause subsumptions : 9
% 1.40/0.67 # Unit Clause-clause subsumption calls : 3
% 1.40/0.67 # Rewrite failures with RHS unbound : 0
% 1.40/0.67 # BW rewrite match attempts : 3
% 1.40/0.67 # BW rewrite match successes : 2
% 1.40/0.67 # Condensation attempts : 60
% 1.40/0.67 # Condensation successes : 0
% 1.40/0.67 # Termbank termtop insertions : 21905
% 1.40/0.67 # Search garbage collected termcells : 299
% 1.40/0.67
% 1.40/0.67 # -------------------------------------------------
% 1.40/0.67 # User time : 0.186 s
% 1.40/0.67 # System time : 0.003 s
% 1.40/0.67 # Total time : 0.189 s
% 1.40/0.67 # Maximum resident set size: 1824 pages
% 1.40/0.67
% 1.40/0.67 # -------------------------------------------------
% 1.40/0.67 # User time : 0.187 s
% 1.40/0.67 # System time : 0.005 s
% 1.40/0.67 # Total time : 0.192 s
% 1.40/0.67 # Maximum resident set size: 1704 pages
% 1.40/0.67 % E---3.1 exiting
% 1.40/0.67 % E exiting
%------------------------------------------------------------------------------