TSTP Solution File: SYO383^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO383^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:45:49 EDT 2024
% Result : Theorem 0.22s 0.51s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 26 ( 7 unt; 8 typ; 0 def)
% Number of atoms : 74 ( 0 equ; 0 cnn)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 293 ( 49 ~; 35 |; 21 &; 188 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 11 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 77 ( 0 ^ 77 !; 0 ?; 77 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
cQ_2: $i > $i > $i > $o ).
thf(decl_23,type,
f: $i > $i ).
thf(decl_24,type,
cP_1: $i > $i > $o ).
thf(decl_25,type,
cQ_1: $i > $i > $i > $o ).
thf(decl_26,type,
d: $i ).
thf(decl_27,type,
c: $i ).
thf(decl_28,type,
b: $i ).
thf(decl_29,type,
a: $i ).
thf(cTHM409_1,conjecture,
~ ( ( cQ_1 @ a @ b @ c )
& ( cP_1 @ a @ a )
& ( cP_1 @ b @ b )
& ( cP_1 @ c @ c )
& ! [X1: $i] : ( cP_1 @ d @ X1 )
& ! [X1: $i,X2: $i] :
( ~ ( cP_1 @ X1 @ X2 )
| ( cP_1 @ ( f @ X1 ) @ X2 ) )
& ! [X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i] :
( ~ ( cQ_1 @ X1 @ X2 @ X3 )
| ~ ( cP_1 @ ( f @ X1 ) @ X4 )
| ~ ( cP_1 @ ( f @ X2 ) @ X5 )
| ~ ( cP_1 @ ( f @ X3 ) @ X6 )
| ( cQ_2 @ X4 @ X5 @ X6 ) )
& ! [X1: $i,X2: $i,X3: $i] :
~ ( cQ_2 @ X1 @ X2 @ X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM409_1) ).
thf(c_0_1,negated_conjecture,
~ ~ ( ( cQ_1 @ a @ b @ c )
& ( cP_1 @ a @ a )
& ( cP_1 @ b @ b )
& ( cP_1 @ c @ c )
& ! [X1: $i] : ( cP_1 @ d @ X1 )
& ! [X1: $i,X2: $i] :
( ~ ( cP_1 @ X1 @ X2 )
| ( cP_1 @ ( f @ X1 ) @ X2 ) )
& ! [X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i] :
( ~ ( cQ_1 @ X1 @ X2 @ X3 )
| ~ ( cP_1 @ ( f @ X1 ) @ X4 )
| ~ ( cP_1 @ ( f @ X2 ) @ X5 )
| ~ ( cP_1 @ ( f @ X3 ) @ X6 )
| ( cQ_2 @ X4 @ X5 @ X6 ) )
& ! [X1: $i,X2: $i,X3: $i] :
~ ( cQ_2 @ X1 @ X2 @ X3 ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM409_1])]) ).
thf(c_0_2,negated_conjecture,
! [X19: $i,X20: $i,X21: $i,X22: $i,X23: $i,X24: $i,X25: $i,X26: $i,X27: $i,X28: $i,X29: $i,X30: $i] :
( ( cQ_1 @ a @ b @ c )
& ( cP_1 @ a @ a )
& ( cP_1 @ b @ b )
& ( cP_1 @ c @ c )
& ( cP_1 @ d @ X19 )
& ( ~ ( cP_1 @ X20 @ X21 )
| ( cP_1 @ ( f @ X20 ) @ X21 ) )
& ( ~ ( cQ_1 @ X22 @ X23 @ X24 )
| ~ ( cP_1 @ ( f @ X22 ) @ X25 )
| ~ ( cP_1 @ ( f @ X23 ) @ X26 )
| ~ ( cP_1 @ ( f @ X24 ) @ X27 )
| ( cQ_2 @ X25 @ X26 @ X27 ) )
& ~ ( cQ_2 @ X28 @ X29 @ X30 ) ),
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,X2: $i,X3: $i,X5: $i,X4: $i,X6: $i] :
( ( cQ_2 @ X4 @ X5 @ X6 )
| ~ ( cQ_1 @ X1 @ X2 @ X3 )
| ~ ( cP_1 @ ( f @ X1 ) @ X4 )
| ~ ( cP_1 @ ( f @ X2 ) @ X5 )
| ~ ( cP_1 @ ( f @ X3 ) @ X6 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
~ ( cQ_2 @ X1 @ X2 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X6: $i,X5: $i,X4: $i,X3: $i,X2: $i,X1: $i] :
( ~ ( cP_1 @ ( f @ X1 ) @ X2 )
| ~ ( cP_1 @ ( f @ X3 ) @ X4 )
| ~ ( cP_1 @ ( f @ X5 ) @ X6 )
| ~ ( cQ_1 @ X5 @ X3 @ X1 ) ),
inference(sr,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X1: $i,X2: $i] :
( ( cP_1 @ ( f @ X1 ) @ X2 )
| ~ ( cP_1 @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i,X3: $i,X2: $i,X4: $i,X5: $i,X6: $i] :
( ~ ( cP_1 @ ( f @ X1 ) @ X2 )
| ~ ( cP_1 @ ( f @ X3 ) @ X4 )
| ~ ( cQ_1 @ X3 @ X1 @ X5 )
| ~ ( cP_1 @ X5 @ X6 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i] :
( ~ ( cP_1 @ ( f @ X1 ) @ X2 )
| ~ ( cQ_1 @ X1 @ X3 @ X4 )
| ~ ( cP_1 @ X4 @ X5 )
| ~ ( cP_1 @ X3 @ X6 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X3: $i,X2: $i,X1: $i,X4: $i,X5: $i,X6: $i] :
( ~ ( cQ_1 @ X1 @ X2 @ X3 )
| ~ ( cP_1 @ X3 @ X4 )
| ~ ( cP_1 @ X2 @ X5 )
| ~ ( cP_1 @ X1 @ X6 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
thf(c_0_10,negated_conjecture,
cQ_1 @ a @ b @ c,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ~ ( cP_1 @ c @ X1 )
| ~ ( cP_1 @ b @ X2 )
| ~ ( cP_1 @ a @ X3 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_12,negated_conjecture,
cP_1 @ c @ c,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i,X2: $i] :
( ~ ( cP_1 @ b @ X1 )
| ~ ( cP_1 @ a @ X2 ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_14,negated_conjecture,
cP_1 @ b @ b,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_15,negated_conjecture,
cP_1 @ a @ a,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i] :
~ ( cP_1 @ a @ X1 ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_15,c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYO383^5 : TPTP v8.2.0. Released v4.0.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 09:45:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.50 Running higher-order theorem proving
% 0.22/0.50 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.22/0.51 # Version: 3.1.0-ho
% 0.22/0.51 # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting full_lambda_5 with 300s (1) cores
% 0.22/0.51 # Starting new_ho_10_unif with 300s (1) cores
% 0.22/0.51 # new_bool_1 with pid 3162 completed with status 0
% 0.22/0.51 # Result found by new_bool_1
% 0.22/0.51 # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.51 # Search class: HHUNF-FFSS11-SFFFFFNN
% 0.22/0.51 # partial match(1): HHUNF-FFSF11-SFFFFFNN
% 0.22/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting new_ho_10 with 181s (1) cores
% 0.22/0.51 # new_ho_10 with pid 3166 completed with status 0
% 0.22/0.51 # Result found by new_ho_10
% 0.22/0.51 # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.51 # Search class: HHUNF-FFSS11-SFFFFFNN
% 0.22/0.51 # partial match(1): HHUNF-FFSF11-SFFFFFNN
% 0.22/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting new_ho_10 with 181s (1) cores
% 0.22/0.51 # Preprocessing time : 0.001 s
% 0.22/0.51 # Presaturation interreduction done
% 0.22/0.51
% 0.22/0.51 # Proof found!
% 0.22/0.51 # SZS status Theorem
% 0.22/0.51 # SZS output start CNFRefutation
% See solution above
% 0.22/0.51 # Parsed axioms : 9
% 0.22/0.51 # Removed by relevancy pruning/SinE : 8
% 0.22/0.51 # Initial clauses : 8
% 0.22/0.51 # Removed in clause preprocessing : 0
% 0.22/0.51 # Initial clauses in saturation : 8
% 0.22/0.51 # Processed clauses : 22
% 0.22/0.51 # ...of these trivial : 0
% 0.22/0.51 # ...subsumed : 0
% 0.22/0.51 # ...remaining for further processing : 22
% 0.22/0.51 # Other redundant clauses eliminated : 0
% 0.22/0.51 # Clauses deleted for lack of memory : 0
% 0.22/0.51 # Backward-subsumed : 2
% 0.22/0.51 # Backward-rewritten : 0
% 0.22/0.51 # Generated clauses : 7
% 0.22/0.51 # ...of the previous two non-redundant : 6
% 0.22/0.51 # ...aggressively subsumed : 0
% 0.22/0.51 # Contextual simplify-reflections : 0
% 0.22/0.51 # Paramodulations : 6
% 0.22/0.51 # Factorizations : 0
% 0.22/0.51 # NegExts : 0
% 0.22/0.51 # Equation resolutions : 0
% 0.22/0.51 # Disequality decompositions : 0
% 0.22/0.51 # Total rewrite steps : 0
% 0.22/0.51 # ...of those cached : 0
% 0.22/0.51 # Propositional unsat checks : 0
% 0.22/0.51 # Propositional check models : 0
% 0.22/0.51 # Propositional check unsatisfiable : 0
% 0.22/0.51 # Propositional clauses : 0
% 0.22/0.51 # Propositional clauses after purity: 0
% 0.22/0.51 # Propositional unsat core size : 0
% 0.22/0.51 # Propositional preprocessing time : 0.000
% 0.22/0.51 # Propositional encoding time : 0.000
% 0.22/0.51 # Propositional solver time : 0.000
% 0.22/0.51 # Success case prop preproc time : 0.000
% 0.22/0.51 # Success case prop encoding time : 0.000
% 0.22/0.51 # Success case prop solver time : 0.000
% 0.22/0.51 # Current number of processed clauses : 11
% 0.22/0.51 # Positive orientable unit clauses : 4
% 0.22/0.51 # Positive unorientable unit clauses: 0
% 0.22/0.51 # Negative unit clauses : 2
% 0.22/0.51 # Non-unit-clauses : 5
% 0.22/0.51 # Current number of unprocessed clauses: 0
% 0.22/0.51 # ...number of literals in the above : 0
% 0.22/0.51 # Current number of archived formulas : 0
% 0.22/0.51 # Current number of archived clauses : 11
% 0.22/0.51 # Clause-clause subsumption calls (NU) : 36
% 0.22/0.51 # Rec. Clause-clause subsumption calls : 13
% 0.22/0.51 # Non-unit clause-clause subsumptions : 1
% 0.22/0.51 # Unit Clause-clause subsumption calls : 6
% 0.22/0.51 # Rewrite failures with RHS unbound : 0
% 0.22/0.51 # BW rewrite match attempts : 0
% 0.22/0.51 # BW rewrite match successes : 0
% 0.22/0.51 # Condensation attempts : 22
% 0.22/0.51 # Condensation successes : 0
% 0.22/0.51 # Termbank termtop insertions : 941
% 0.22/0.51 # Search garbage collected termcells : 105
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.003 s
% 0.22/0.51 # System time : 0.003 s
% 0.22/0.51 # Total time : 0.006 s
% 0.22/0.51 # Maximum resident set size: 1776 pages
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.003 s
% 0.22/0.51 # System time : 0.006 s
% 0.22/0.51 # Total time : 0.009 s
% 0.22/0.51 # Maximum resident set size: 1700 pages
% 0.22/0.51 % E---3.1 exiting
% 0.22/0.52 % E exiting
%------------------------------------------------------------------------------