TSTP Solution File: SYO169^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO169^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:44:49 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 28 ( 9 unt; 6 typ; 0 def)
% Number of atoms : 68 ( 0 equ; 0 cnn)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 259 ( 27 ~; 24 |; 14 &; 186 @)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 6 usr; 5 con; 0-3 aty)
% Number of variables : 80 ( 0 ^ 80 !; 0 ?; 80 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
ab: $i ).
thf(decl_23,type,
a: $i ).
thf(decl_24,type,
b: $i ).
thf(decl_25,type,
cP: $i > $i > $i > $o ).
thf(decl_26,type,
cPx: $i > $i > $o ).
thf(decl_27,type,
e: $i ).
thf(cGRP_COMM,conjecture,
( ( ! [X1: $i] : ( cP @ e @ X1 @ X1 )
& ! [X2: $i] : ( cP @ X2 @ e @ X2 )
& ! [X3: $i] : ( cP @ X3 @ X3 @ e )
& ! [X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i] :
( ( ( cP @ X1 @ X2 @ X4 )
& ( cP @ X2 @ X3 @ X5 ) )
=> ( ( cP @ X4 @ X3 @ X6 )
<=> ( cPx @ X5 @ X6 ) ) ) )
=> ( ( cP @ a @ b @ ab )
=> ( cP @ b @ a @ ab ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cGRP_COMM) ).
thf(c_0_1,negated_conjecture,
~ ( ( ! [X1: $i] : ( cP @ e @ X1 @ X1 )
& ! [X2: $i] : ( cP @ X2 @ e @ X2 )
& ! [X3: $i] : ( cP @ X3 @ X3 @ e )
& ! [X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i] :
( ( ( cP @ X1 @ X2 @ X4 )
& ( cP @ X2 @ X3 @ X5 ) )
=> ( ( cP @ X4 @ X3 @ X6 )
<=> ( cPx @ X5 @ X6 ) ) ) )
=> ( ( cP @ a @ b @ ab )
=> ( cP @ b @ a @ ab ) ) ),
inference(assume_negation,[status(cth)],[cGRP_COMM]) ).
thf(c_0_2,negated_conjecture,
! [X16: $i,X17: $i,X18: $i,X19: $i,X20: $i,X21: $i,X22: $i,X23: $i,X24: $i] :
( ( cP @ e @ X16 @ X16 )
& ( cP @ X17 @ e @ X17 )
& ( cP @ X18 @ X18 @ e )
& ( ~ ( cP @ X22 @ X21 @ X24 )
| ( cPx @ X23 @ X24 )
| ~ ( cP @ X19 @ X20 @ X22 )
| ~ ( cP @ X20 @ X21 @ X23 ) )
& ( ~ ( cPx @ X23 @ X24 )
| ( cP @ X22 @ X21 @ X24 )
| ~ ( cP @ X19 @ X20 @ X22 )
| ~ ( cP @ X20 @ X21 @ X23 ) )
& ( cP @ a @ b @ ab )
& ~ ( cP @ b @ a @ ab ) ),
inference(distribute,[status(thm)],[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,
! [X1: $i,X3: $i,X2: $i,X6: $i,X5: $i,X4: $i] :
( ( cPx @ X4 @ X3 )
| ~ ( cP @ X1 @ X2 @ X3 )
| ~ ( cP @ X5 @ X6 @ X1 )
| ~ ( cP @ X6 @ X2 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: $i] : ( cP @ e @ X1 @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X1: $i,X4: $i,X3: $i,X2: $i] :
( ( cPx @ X1 @ X2 )
| ~ ( cP @ X3 @ e @ X4 )
| ~ ( cP @ X4 @ X1 @ X2 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X1: $i] : ( cP @ X1 @ e @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X2: $i,X6: $i,X5: $i,X4: $i,X3: $i,X1: $i] :
( ( cP @ X3 @ X4 @ X2 )
| ~ ( cPx @ X1 @ X2 )
| ~ ( cP @ X5 @ X6 @ X3 )
| ~ ( cP @ X6 @ X4 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i] : ( cP @ X1 @ X1 @ e ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( cPx @ X1 @ X2 )
| ~ ( cP @ X3 @ X1 @ X2 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i,X2: $i,X4: $i,X3: $i] :
( ( cP @ X1 @ X2 @ X3 )
| ~ ( cP @ X4 @ X2 @ X1 )
| ~ ( cPx @ e @ X3 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i] : ( cPx @ e @ X1 ),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
thf(c_0_12,negated_conjecture,
! [X4: $i,X3: $i,X2: $i,X1: $i] :
( ( cP @ X1 @ X2 @ X3 )
| ~ ( cP @ X4 @ X2 @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).
thf(c_0_13,negated_conjecture,
! [X2: $i,X1: $i,X4: $i,X3: $i] :
( ( cPx @ X1 @ X2 )
| ~ ( cP @ X3 @ e @ X2 )
| ~ ( cP @ X4 @ X1 @ X3 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_6]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X2: $i] : ( cP @ X1 @ e @ X2 ),
inference(spm,[status(thm)],[c_0_12,c_0_6]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i,X2: $i,X4: $i,X3: $i] :
( ( cP @ X1 @ X2 @ X3 )
| ~ ( cP @ X4 @ e @ X1 )
| ~ ( cPx @ X2 @ X3 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_4]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i,X2: $i,X3: $i,X4: $i] :
( ( cPx @ X1 @ X2 )
| ~ ( cP @ X3 @ X1 @ X4 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( cP @ X1 @ X2 @ X3 )
| ~ ( cPx @ X2 @ X3 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_14])]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i,X2: $i] : ( cPx @ X1 @ X2 ),
inference(spm,[status(thm)],[c_0_16,c_0_4]) ).
thf(c_0_19,negated_conjecture,
~ ( cP @ b @ a @ ab ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_20,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] : ( cP @ X1 @ X2 @ X3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
thf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO169^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n019.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 08:39:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/0.47 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.49 # Version: 3.1.0-ho
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.49 # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.49 # Starting sh4l with 300s (1) cores
% 0.20/0.49 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.20/0.49 # sh4l with pid 23745 completed with status 0
% 0.20/0.49 # Result found by sh4l
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.49 # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.49 # Starting sh4l with 300s (1) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HHUNS-FFSF00-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.49 # new_ho_10 with pid 23751 completed with status 0
% 0.20/0.49 # Result found by new_ho_10
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.49 # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.49 # Starting sh4l with 300s (1) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HHUNS-FFSF00-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 7
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 13
% 0.20/0.49 # Removed in clause preprocessing : 6
% 0.20/0.49 # Initial clauses in saturation : 7
% 0.20/0.49 # Processed clauses : 45
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 1
% 0.20/0.49 # ...remaining for further processing : 44
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 2
% 0.20/0.49 # Backward-rewritten : 33
% 0.20/0.49 # Generated clauses : 101
% 0.20/0.49 # ...of the previous two non-redundant : 90
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 101
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 60
% 0.20/0.49 # ...of those cached : 22
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 2
% 0.20/0.49 # Positive orientable unit clauses : 2
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 0
% 0.20/0.49 # Non-unit-clauses : 0
% 0.20/0.49 # Current number of unprocessed clauses: 56
% 0.20/0.49 # ...number of literals in the above : 101
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 42
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 57
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 45
% 0.20/0.49 # Non-unit clause-clause subsumptions : 3
% 0.20/0.49 # Unit Clause-clause subsumption calls : 15
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 66
% 0.20/0.49 # BW rewrite match successes : 30
% 0.20/0.49 # Condensation attempts : 45
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 1794
% 0.20/0.49 # Search garbage collected termcells : 219
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.006 s
% 0.20/0.49 # System time : 0.001 s
% 0.20/0.49 # Total time : 0.007 s
% 0.20/0.49 # Maximum resident set size: 1748 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.009 s
% 0.20/0.49 # System time : 0.002 s
% 0.20/0.49 # Total time : 0.011 s
% 0.20/0.49 # Maximum resident set size: 1696 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------