TSTP Solution File: SEV045^5 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SEV045^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:22 EDT 2024
% Result : Theorem 0.10s 0.36s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 25 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 105 ( 5 equ; 0 cnn)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 365 ( 28 ~; 25 |; 18 &; 267 @)
% ( 1 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 7 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 75 ( 0 ^ 75 !; 0 ?; 75 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_sort2,type,
b: $tType ).
thf(decl_22,type,
g: a > b ).
thf(decl_23,type,
f: a > b ).
thf(decl_24,type,
cQ: a > b > b > $o ).
thf(decl_25,type,
cP: a > a > $o ).
thf(decl_26,type,
esk1_0: a ).
thf(decl_27,type,
esk2_0: a ).
thf(cTHM509_pme,conjecture,
( ! [X1: a] :
( ( cP @ X1 @ X1 )
=> ( cQ @ X1 @ ( f @ X1 ) @ ( g @ X1 ) ) )
=> ( ! [X1: a,X2: a] :
( ( cP @ X1 @ X2 )
=> ( cQ @ X1 @ ( f @ X1 ) @ ( f @ X2 ) ) )
=> ( ( ! [X1: a,X2: a] :
( ( cP @ X1 @ X2 )
=> ( cP @ X2 @ X1 ) )
& ! [X1: a,X2: a,X3: a] :
( ( ( cP @ X1 @ X2 )
& ( cP @ X2 @ X3 ) )
=> ( cP @ X1 @ X3 ) ) )
=> ( ( ! [X1: a] :
( ( cP @ X1 @ X1 )
=> ( ! [X4: b,X5: b] :
( ( cQ @ X1 @ X4 @ X5 )
=> ( cQ @ X1 @ X5 @ X4 ) )
& ! [X4: b,X6: b,X7: b] :
( ( ( cQ @ X1 @ X4 @ X6 )
& ( cQ @ X1 @ X6 @ X7 ) )
=> ( cQ @ X1 @ X4 @ X7 ) ) ) )
& ! [X1: a,X2: a] :
( ( cP @ X1 @ X2 )
=> ( ( cQ @ X1 )
= ( cQ @ X2 ) ) ) )
=> ! [X1: a,X2: a] :
( ( cP @ X1 @ X2 )
=> ( cQ @ X1 @ ( f @ X1 ) @ ( g @ X2 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.rxhtnDhDbf/E---3.1_21899.p',cTHM509_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ! [X1: a] :
( ( cP @ X1 @ X1 )
=> ( cQ @ X1 @ ( f @ X1 ) @ ( g @ X1 ) ) )
=> ( ! [X1: a,X2: a] :
( ( cP @ X1 @ X2 )
=> ( cQ @ X1 @ ( f @ X1 ) @ ( f @ X2 ) ) )
=> ( ( ! [X1: a,X2: a] :
( ( cP @ X1 @ X2 )
=> ( cP @ X2 @ X1 ) )
& ! [X1: a,X2: a,X3: a] :
( ( ( cP @ X1 @ X2 )
& ( cP @ X2 @ X3 ) )
=> ( cP @ X1 @ X3 ) ) )
=> ( ( ! [X1: a] :
( ( cP @ X1 @ X1 )
=> ( ! [X4: b,X5: b] :
( ( cQ @ X1 @ X4 @ X5 )
=> ( cQ @ X1 @ X5 @ X4 ) )
& ! [X4: b,X6: b,X7: b] :
( ( ( cQ @ X1 @ X4 @ X6 )
& ( cQ @ X1 @ X6 @ X7 ) )
=> ( cQ @ X1 @ X4 @ X7 ) ) ) )
& ! [X1: a,X2: a] :
( ( cP @ X1 @ X2 )
=> ( ( cQ @ X1 )
= ( cQ @ X2 ) ) ) )
=> ! [X1: a,X2: a] :
( ( cP @ X1 @ X2 )
=> ( cQ @ X1 @ ( f @ X1 ) @ ( g @ X2 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[cTHM509_pme]) ).
thf(c_0_2,negated_conjecture,
! [X26: a,X27: a,X28: a,X29: a,X30: a,X31: a,X32: a,X33: a,X34: a,X35: b,X36: b,X37: b,X38: b,X39: b,X40: a,X41: a] :
( ( ~ ( cP @ X26 @ X26 )
| ( cQ @ X26 @ ( f @ X26 ) @ ( g @ X26 ) ) )
& ( ~ ( cP @ X27 @ X28 )
| ( cQ @ X27 @ ( f @ X27 ) @ ( f @ X28 ) ) )
& ( ~ ( cP @ X29 @ X30 )
| ( cP @ X30 @ X29 ) )
& ( ~ ( cP @ X31 @ X32 )
| ~ ( cP @ X32 @ X33 )
| ( cP @ X31 @ X33 ) )
& ( ~ ( cQ @ X34 @ X35 @ X36 )
| ( cQ @ X34 @ X36 @ X35 )
| ~ ( cP @ X34 @ X34 ) )
& ( ~ ( cQ @ X34 @ X37 @ X38 )
| ~ ( cQ @ X34 @ X38 @ X39 )
| ( cQ @ X34 @ X37 @ X39 )
| ~ ( cP @ X34 @ X34 ) )
& ( ~ ( cP @ X40 @ X41 )
| ( ( cQ @ X40 )
= ( cQ @ X41 ) ) )
& ( cP @ esk1_0 @ esk2_0 )
& ~ ( cQ @ esk1_0 @ ( f @ esk1_0 ) @ ( g @ esk2_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,X2: a,X3: a] :
( ( cP @ X1 @ X3 )
| ~ ( cP @ X1 @ X2 )
| ~ ( cP @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
cP @ esk1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X1: a,X2: a] :
( ( cP @ X2 @ X1 )
| ~ ( cP @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X1: a] :
( ( cP @ X1 @ esk2_0 )
| ~ ( cP @ X1 @ esk1_0 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_7,negated_conjecture,
cP @ esk2_0 @ esk1_0,
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X1: a,X2: a] :
( ( cQ @ X1 @ ( f @ X1 ) @ ( f @ X2 ) )
| ~ ( cP @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
! [X1: a] :
( ( cQ @ X1 @ ( f @ X1 ) @ ( g @ X1 ) )
| ~ ( cP @ X1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
cP @ esk2_0 @ esk2_0,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_11,negated_conjecture,
! [X1: a,X2: a] :
( ( ( cQ @ X1 )
= ( cQ @ X2 ) )
| ~ ( cP @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_12,negated_conjecture,
! [X4: b,X6: b,X5: b,X1: a] :
( ( cQ @ X1 @ X4 @ X6 )
| ~ ( cQ @ X1 @ X4 @ X5 )
| ~ ( cQ @ X1 @ X5 @ X6 )
| ~ ( cP @ X1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_13,negated_conjecture,
cQ @ esk2_0 @ ( f @ esk2_0 ) @ ( f @ esk1_0 ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
thf(c_0_14,negated_conjecture,
! [X5: b,X4: b,X1: a] :
( ( cQ @ X1 @ X5 @ X4 )
| ~ ( cQ @ X1 @ X4 @ X5 )
| ~ ( cP @ X1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_15,negated_conjecture,
cQ @ esk2_0 @ ( f @ esk2_0 ) @ ( g @ esk2_0 ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_16,negated_conjecture,
( ( cQ @ esk2_0 )
= ( cQ @ esk1_0 ) ),
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
thf(c_0_17,negated_conjecture,
! [X4: b] :
( ( cQ @ esk2_0 @ X4 @ ( f @ esk1_0 ) )
| ~ ( cQ @ esk2_0 @ X4 @ ( f @ esk2_0 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_10])]) ).
thf(c_0_18,negated_conjecture,
cQ @ esk2_0 @ ( g @ esk2_0 ) @ ( f @ esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_10])]) ).
thf(c_0_19,negated_conjecture,
! [X46: b,X47: b] :
( ( cQ @ esk2_0 @ X46 @ X47 )
<=> ( cQ @ esk1_0 @ X46 @ X47 ) ),
inference(arg_cong,[status(thm)],[c_0_16]) ).
thf(c_0_20,negated_conjecture,
cQ @ esk2_0 @ ( g @ esk2_0 ) @ ( f @ esk1_0 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_21,negated_conjecture,
! [X4: b,X5: b] :
( ( cQ @ esk1_0 @ X4 @ X5 )
| ~ ( cQ @ esk2_0 @ X4 @ X5 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_19]) ).
thf(c_0_22,negated_conjecture,
cQ @ esk2_0 @ ( f @ esk1_0 ) @ ( g @ esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_20]),c_0_10])]) ).
thf(c_0_23,negated_conjecture,
~ ( cQ @ esk1_0 @ ( f @ esk1_0 ) @ ( g @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : SEV045^5 : TPTP v8.2.0. Released v4.0.0.
% 0.00/0.06 % Command : run_E %s %d THM
% 0.05/0.24 % Computer : n032.cluster.edu
% 0.05/0.24 % Model : x86_64 x86_64
% 0.05/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.24 % Memory : 8042.1875MB
% 0.05/0.24 % OS : Linux 3.10.0-693.el7.x86_64
% 0.05/0.24 % CPULimit : 300
% 0.05/0.24 % WCLimit : 300
% 0.05/0.24 % DateTime : Fri Jun 21 18:57:54 EDT 2024
% 0.05/0.25 % CPUTime :
% 0.10/0.35 Running higher-order theorem proving
% 0.10/0.35 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.rxhtnDhDbf/E---3.1_21899.p
% 0.10/0.36 # Version: 3.2.0-ho
% 0.10/0.36 # Preprocessing class: HSMSSMSSSSSNSSN.
% 0.10/0.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.36 # Starting new_ho_11 with 1500s (5) cores
% 0.10/0.36 # Starting sh5l with 300s (1) cores
% 0.10/0.36 # Starting new_ho_9 with 300s (1) cores
% 0.10/0.36 # Starting ho_unfolding_4 with 300s (1) cores
% 0.10/0.36 # new_ho_11 with pid 21999 completed with status 0
% 0.10/0.36 # Result found by new_ho_11
% 0.10/0.36 # Preprocessing class: HSMSSMSSSSSNSSN.
% 0.10/0.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.36 # Starting new_ho_11 with 1500s (5) cores
% 0.10/0.36 # No SInE strategy applied
% 0.10/0.36 # Search class: HHUSF-FFSF11-SSSFFFNN
% 0.10/0.36 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.36 # Starting sh3 with 811s (1) cores
% 0.10/0.36 # Starting new_ho_11 with 151s (1) cores
% 0.10/0.36 # Starting new_bool_3 with 136s (1) cores
% 0.10/0.36 # Starting new_bool_1 with 136s (1) cores
% 0.10/0.36 # Starting new_bool_2 with 136s (1) cores
% 0.10/0.36 # new_bool_1 with pid 22008 completed with status 0
% 0.10/0.36 # Result found by new_bool_1
% 0.10/0.36 # Preprocessing class: HSMSSMSSSSSNSSN.
% 0.10/0.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.36 # Starting new_ho_11 with 1500s (5) cores
% 0.10/0.36 # No SInE strategy applied
% 0.10/0.36 # Search class: HHUSF-FFSF11-SSSFFFNN
% 0.10/0.36 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.36 # Starting sh3 with 811s (1) cores
% 0.10/0.36 # Starting new_ho_11 with 151s (1) cores
% 0.10/0.36 # Starting new_bool_3 with 136s (1) cores
% 0.10/0.36 # Starting new_bool_1 with 136s (1) cores
% 0.10/0.36 # Preprocessing time : 0.001 s
% 0.10/0.36 # Presaturation interreduction done
% 0.10/0.36
% 0.10/0.36 # Proof found!
% 0.10/0.36 # SZS status Theorem
% 0.10/0.36 # SZS output start CNFRefutation
% See solution above
% 0.10/0.36 # Parsed axioms : 7
% 0.10/0.36 # Removed by relevancy pruning/SinE : 0
% 0.10/0.36 # Initial clauses : 15
% 0.10/0.36 # Removed in clause preprocessing : 6
% 0.10/0.36 # Initial clauses in saturation : 9
% 0.10/0.36 # Processed clauses : 67
% 0.10/0.36 # ...of these trivial : 3
% 0.10/0.36 # ...subsumed : 3
% 0.10/0.36 # ...remaining for further processing : 61
% 0.10/0.36 # Other redundant clauses eliminated : 0
% 0.10/0.36 # Clauses deleted for lack of memory : 0
% 0.10/0.36 # Backward-subsumed : 0
% 0.10/0.36 # Backward-rewritten : 2
% 0.10/0.36 # Generated clauses : 143
% 0.10/0.36 # ...of the previous two non-redundant : 93
% 0.10/0.36 # ...aggressively subsumed : 0
% 0.10/0.36 # Contextual simplify-reflections : 0
% 0.10/0.36 # Paramodulations : 129
% 0.10/0.36 # Factorizations : 0
% 0.10/0.36 # NegExts : 0
% 0.10/0.36 # Equation resolutions : 0
% 0.10/0.36 # Disequality decompositions : 0
% 0.10/0.36 # Total rewrite steps : 83
% 0.10/0.36 # ...of those cached : 60
% 0.10/0.36 # Propositional unsat checks : 0
% 0.10/0.36 # Propositional check models : 0
% 0.10/0.36 # Propositional check unsatisfiable : 0
% 0.10/0.36 # Propositional clauses : 0
% 0.10/0.36 # Propositional clauses after purity: 0
% 0.10/0.36 # Propositional unsat core size : 0
% 0.10/0.36 # Propositional preprocessing time : 0.000
% 0.10/0.36 # Propositional encoding time : 0.000
% 0.10/0.36 # Propositional solver time : 0.000
% 0.10/0.36 # Success case prop preproc time : 0.000
% 0.10/0.36 # Success case prop encoding time : 0.000
% 0.10/0.36 # Success case prop solver time : 0.000
% 0.10/0.36 # Current number of processed clauses : 47
% 0.10/0.36 # Positive orientable unit clauses : 24
% 0.10/0.36 # Positive unorientable unit clauses: 0
% 0.10/0.36 # Negative unit clauses : 1
% 0.10/0.36 # Non-unit-clauses : 22
% 0.10/0.36 # Current number of unprocessed clauses: 41
% 0.10/0.36 # ...number of literals in the above : 82
% 0.10/0.36 # Current number of archived formulas : 0
% 0.10/0.36 # Current number of archived clauses : 14
% 0.10/0.36 # Clause-clause subsumption calls (NU) : 54
% 0.10/0.36 # Rec. Clause-clause subsumption calls : 52
% 0.10/0.36 # Non-unit clause-clause subsumptions : 3
% 0.10/0.36 # Unit Clause-clause subsumption calls : 0
% 0.10/0.36 # Rewrite failures with RHS unbound : 0
% 0.10/0.36 # BW rewrite match attempts : 22
% 0.10/0.36 # BW rewrite match successes : 2
% 0.10/0.36 # Condensation attempts : 0
% 0.10/0.36 # Condensation successes : 0
% 0.10/0.36 # Termbank termtop insertions : 3695
% 0.10/0.36 # Search garbage collected termcells : 462
% 0.10/0.36
% 0.10/0.36 # -------------------------------------------------
% 0.10/0.36 # User time : 0.005 s
% 0.10/0.36 # System time : 0.001 s
% 0.10/0.36 # Total time : 0.005 s
% 0.10/0.36 # Maximum resident set size: 1848 pages
% 0.10/0.36
% 0.10/0.36 # -------------------------------------------------
% 0.10/0.36 # User time : 0.016 s
% 0.10/0.36 # System time : 0.007 s
% 0.10/0.36 # Total time : 0.023 s
% 0.10/0.36 # Maximum resident set size: 1728 pages
% 0.10/0.36 % E---3.1 exiting
% 0.10/0.36 % E exiting
%------------------------------------------------------------------------------