TSTP Solution File: SEV104^5 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SEV104^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 : Mon Jun 24 15:53:32 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 15 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 79 ( 0 equ; 0 cnn)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 244 ( 23 ~; 25 |; 27 &; 157 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 8 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 57 ( 0 ^ 55 !; 2 ?; 57 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_sort2,type,
b: $tType ).
thf(decl_22,type,
cR: a > a > $o ).
thf(decl_23,type,
z: a ).
thf(decl_24,type,
f: a > b > $o ).
thf(decl_25,type,
cS: b > b > $o ).
thf(decl_26,type,
esk1_1: a > b ).
thf(decl_27,type,
esk2_0: b ).
thf(decl_28,type,
esk3_0: a ).
thf(decl_29,type,
esk4_0: a ).
thf(cTHM552D_pme,conjecture,
( ( ! [X1: a,X2: a,X3: a] :
( ( ( cR @ X1 @ X2 )
& ( cR @ X3 @ X2 ) )
=> ( cR @ X1 @ X3 ) )
& ! [X4: a] : ( cR @ X4 @ X4 ) )
=> ( ( ! [X4: a] :
? [X5: b] : ( f @ X4 @ X5 )
& ! [X4: a,X6: b,X7: b] :
( ( ( f @ X4 @ X6 )
& ( f @ X4 @ X7 ) )
=> ( cS @ X6 @ X7 ) )
& ! [X8: a,X9: a,X5: b] :
( ( ( f @ X8 @ X5 )
& ( f @ X9 @ X5 ) )
=> ( cR @ X8 @ X9 ) ) )
=> ! [X5: b,X8: a,X9: a] :
( ( ! [X3: a] :
( ( f @ X8 @ X5 )
| ( ~ ( f @ X3 @ X5 )
& ( cR @ X8 @ z ) ) )
& ! [X3: a] :
( ( f @ X9 @ X5 )
| ( ~ ( f @ X3 @ X5 )
& ( cR @ X9 @ z ) ) ) )
=> ( cR @ X8 @ X9 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6Cg24JXaca/E---3.1_28312.p',cTHM552D_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ( ! [X1: a,X2: a,X3: a] :
( ( ( cR @ X1 @ X2 )
& ( cR @ X3 @ X2 ) )
=> ( cR @ X1 @ X3 ) )
& ! [X4: a] : ( cR @ X4 @ X4 ) )
=> ( ( ! [X4: a] :
? [X5: b] : ( f @ X4 @ X5 )
& ! [X4: a,X6: b,X7: b] :
( ( ( f @ X4 @ X6 )
& ( f @ X4 @ X7 ) )
=> ( cS @ X6 @ X7 ) )
& ! [X8: a,X9: a,X5: b] :
( ( ( f @ X8 @ X5 )
& ( f @ X9 @ X5 ) )
=> ( cR @ X8 @ X9 ) ) )
=> ! [X5: b,X8: a,X9: a] :
( ( ! [X3: a] :
( ( f @ X8 @ X5 )
| ( ~ ( f @ X3 @ X5 )
& ( cR @ X8 @ z ) ) )
& ! [X3: a] :
( ( f @ X9 @ X5 )
| ( ~ ( f @ X3 @ X5 )
& ( cR @ X9 @ z ) ) ) )
=> ( cR @ X8 @ X9 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM552D_pme])]) ).
thf(c_0_2,negated_conjecture,
! [X27: a,X28: a,X29: a,X30: a,X31: a,X33: a,X34: b,X35: b,X36: a,X37: a,X38: b,X42: a,X43: a] :
( ( ~ ( cR @ X27 @ X28 )
| ~ ( cR @ X29 @ X28 )
| ( cR @ X27 @ X29 ) )
& ( cR @ X30 @ X30 )
& ( f @ X31 @ ( esk1_1 @ X31 ) )
& ( ~ ( f @ X33 @ X34 )
| ~ ( f @ X33 @ X35 )
| ( cS @ X34 @ X35 ) )
& ( ~ ( f @ X36 @ X38 )
| ~ ( f @ X37 @ X38 )
| ( cR @ X36 @ X37 ) )
& ( ~ ( f @ X42 @ esk2_0 )
| ( f @ esk3_0 @ esk2_0 ) )
& ( ( cR @ esk3_0 @ z )
| ( f @ esk3_0 @ esk2_0 ) )
& ( ~ ( f @ X43 @ esk2_0 )
| ( f @ esk4_0 @ esk2_0 ) )
& ( ( cR @ esk4_0 @ z )
| ( f @ esk4_0 @ esk2_0 ) )
& ~ ( cR @ esk3_0 @ esk4_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(fof_nnf,[status(thm)],[c_0_1])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X1: a,X3: a,X2: a] :
( ( cR @ X1 @ X3 )
| ~ ( cR @ X1 @ X2 )
| ~ ( cR @ X3 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( ( cR @ esk4_0 @ z )
| ( f @ esk4_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X1: a] :
( ( f @ esk4_0 @ esk2_0 )
| ( cR @ X1 @ esk4_0 )
| ~ ( cR @ X1 @ z ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_6,negated_conjecture,
( ( cR @ esk3_0 @ z )
| ( f @ esk3_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
~ ( cR @ esk3_0 @ esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
! [X1: a] :
( ( f @ esk4_0 @ esk2_0 )
| ~ ( f @ X1 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
! [X1: a,X2: a,X5: b] :
( ( cR @ X1 @ X2 )
| ~ ( f @ X1 @ X5 )
| ~ ( f @ X2 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
f @ esk4_0 @ esk2_0,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]),c_0_8]) ).
thf(c_0_11,negated_conjecture,
! [X1: a] :
( ( f @ esk3_0 @ esk2_0 )
| ~ ( f @ X1 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_12,negated_conjecture,
! [X1: a] :
( ( cR @ X1 @ esk4_0 )
| ~ ( f @ X1 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_13,negated_conjecture,
f @ esk3_0 @ esk2_0,
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
thf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEV104^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n021.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Fri Jun 21 19:29:09 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/0.47 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/tmp/tmp.6Cg24JXaca/E---3.1_28312.p
% 0.20/0.49 # Version: 3.2.0-ho
% 0.20/0.49 # Preprocessing class: HSMSSMSSSSSNFFN.
% 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 new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting full_lambda_5 with 300s (1) cores
% 0.20/0.49 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.49 # new_bool_1 with pid 28392 completed with status 0
% 0.20/0.49 # Result found by new_bool_1
% 0.20/0.49 # Preprocessing class: HSMSSMSSSSSNFFN.
% 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 new_bool_1 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: HGUNS-FFSF11-SFFFFFNN
% 0.20/0.49 # partial match(1): HGUNF-FFSF11-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 181s (1) cores
% 0.20/0.49 # new_ho_10 with pid 28396 completed with status 0
% 0.20/0.49 # Result found by new_ho_10
% 0.20/0.49 # Preprocessing class: HSMSSMSSSSSNFFN.
% 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 new_bool_1 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: HGUNS-FFSF11-SFFFFFNN
% 0.20/0.49 # partial match(1): HGUNF-FFSF11-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 181s (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 : 6
% 0.20/0.49 # Initial clauses : 10
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 10
% 0.20/0.49 # Processed clauses : 25
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 25
% 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 : 0
% 0.20/0.49 # Backward-rewritten : 5
% 0.20/0.49 # Generated clauses : 16
% 0.20/0.49 # ...of the previous two non-redundant : 11
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 1
% 0.20/0.49 # Paramodulations : 16
% 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 : 8
% 0.20/0.49 # ...of those cached : 4
% 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 : 10
% 0.20/0.49 # Positive orientable unit clauses : 4
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 1
% 0.20/0.49 # Non-unit-clauses : 5
% 0.20/0.49 # Current number of unprocessed clauses: 5
% 0.20/0.49 # ...number of literals in the above : 11
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 15
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 10
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 9
% 0.20/0.49 # Non-unit clause-clause subsumptions : 1
% 0.20/0.49 # Unit Clause-clause subsumption calls : 2
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 6
% 0.20/0.49 # BW rewrite match successes : 2
% 0.20/0.49 # Condensation attempts : 25
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 1293
% 0.20/0.49 # Search garbage collected termcells : 428
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.004 s
% 0.20/0.49 # System time : 0.001 s
% 0.20/0.49 # Total time : 0.005 s
% 0.20/0.49 # Maximum resident set size: 1920 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.006 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.009 s
% 0.20/0.49 # Maximum resident set size: 1720 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------