TSTP Solution File: SET611^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET611^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 02:54:55 EDT 2024
% Result : Theorem 0.22s 0.52s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 5 unt; 5 typ; 0 def)
% Number of atoms : 144 ( 2 equ; 0 cnn)
% Maximal formula atoms : 84 ( 6 avg)
% Number of connectives : 326 ( 74 ~; 102 |; 21 &; 125 @)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 19 ( 3 ^ 16 !; 0 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
epred1_0: a > $o ).
thf(decl_23,type,
epred2_0: a > $o ).
thf(decl_24,type,
esk1_0: a ).
thf(decl_25,type,
esk2_0: a ).
thf(cBOOL_PROP_84_pme,conjecture,
! [X1: a > $o,X2: a > $o] :
( ( ( ^ [X3: a] :
( ( X1 @ X3 )
& ( X2 @ X3 ) ) )
= ( ^ [X3: a] : ~ $true ) )
<=> ( ( ^ [X3: a] :
( ( X1 @ X3 )
& ~ ( X2 @ X3 ) ) )
= X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBOOL_PROP_84_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > $o,X2: a > $o] :
( ! [X6: a] :
( ( ( X1 @ X6 )
& ( X2 @ X6 ) )
<=> ~ $true )
<=> ! [X7: a] :
( ( ( X1 @ X7 )
& ~ ( X2 @ X7 ) )
<=> ( X1 @ X7 ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cBOOL_PROP_84_pme])])]) ).
thf(c_0_2,negated_conjecture,
! [X12: a,X13: a] :
( ( ~ ( epred1_0 @ esk2_0 )
| ( epred2_0 @ esk2_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| $true )
& ( ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk2_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| $true )
& ( ~ ( epred2_0 @ esk2_0 )
| ( epred1_0 @ esk2_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| $true )
& ( ~ ( epred1_0 @ esk2_0 )
| ( epred2_0 @ esk2_0 )
| ~ ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 )
| ~ $true )
& ( ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 )
| ~ $true )
& ( ~ ( epred2_0 @ esk2_0 )
| ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 )
| ~ $true )
& ( ~ ( epred1_0 @ esk2_0 )
| ( epred2_0 @ esk2_0 )
| ~ ( epred1_0 @ esk2_0 )
| ( epred2_0 @ esk1_0 )
| ~ $true )
& ( ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk2_0 )
| ( epred2_0 @ esk1_0 )
| ~ $true )
& ( ~ ( epred2_0 @ esk2_0 )
| ( epred1_0 @ esk2_0 )
| ( epred2_0 @ esk1_0 )
| ~ $true )
& ( ~ ( epred1_0 @ X13 )
| ( epred2_0 @ X13 )
| ( epred1_0 @ X13 )
| ~ ( epred1_0 @ X12 )
| ~ ( epred2_0 @ X12 )
| ~ $true )
& ( ( epred1_0 @ X13 )
| ~ ( epred1_0 @ X13 )
| ~ ( epred1_0 @ X12 )
| ~ ( epred2_0 @ X12 )
| ~ $true )
& ( ~ ( epred2_0 @ X13 )
| ~ ( epred1_0 @ X13 )
| ~ ( epred1_0 @ X12 )
| ~ ( epred2_0 @ X12 )
| ~ $true )
& ( ~ ( epred1_0 @ X13 )
| ( epred2_0 @ X13 )
| ( epred1_0 @ X13 )
| ( epred1_0 @ X12 )
| $true )
& ( ( epred1_0 @ X13 )
| ~ ( epred1_0 @ X13 )
| ( epred1_0 @ X12 )
| $true )
& ( ~ ( epred2_0 @ X13 )
| ~ ( epred1_0 @ X13 )
| ( epred1_0 @ X12 )
| $true )
& ( ~ ( epred1_0 @ X13 )
| ( epred2_0 @ X13 )
| ( epred1_0 @ X13 )
| ( epred2_0 @ X12 )
| $true )
& ( ( epred1_0 @ X13 )
| ~ ( epred1_0 @ X13 )
| ( epred2_0 @ X12 )
| $true )
& ( ~ ( epred2_0 @ X13 )
| ~ ( epred1_0 @ X13 )
| ( epred2_0 @ X12 )
| $true ) ),
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,
! [X3: a,X6: a] :
( ~ ( epred2_0 @ X3 )
| ~ ( epred1_0 @ X3 )
| ~ ( epred1_0 @ X6 )
| ~ ( epred2_0 @ X6 )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk2_0 )
| ( epred2_0 @ esk1_0 )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
( ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
( ( epred2_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X6: a,X3: a] :
( ~ ( epred1_0 @ X6 )
| ~ ( epred1_0 @ X3 )
| ~ ( epred2_0 @ X6 )
| ~ ( epred2_0 @ X3 ) ),
inference(cn,[status(thm)],[c_0_3]) ).
thf(c_0_8,negated_conjecture,
( ( epred1_0 @ esk2_0 )
| ( epred2_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_4]) ).
thf(c_0_9,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk2_0 ) ),
inference(cn,[status(thm)],[c_0_5]) ).
thf(c_0_10,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk2_0 )
| ~ ( epred1_0 @ esk2_0 ) ),
inference(cn,[status(thm)],[c_0_6]) ).
thf(c_0_11,negated_conjecture,
! [X3: a] :
( ( epred1_0 @ esk2_0 )
| ~ ( epred1_0 @ X3 )
| ~ ( epred2_0 @ X3 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
thf(c_0_12,negated_conjecture,
( ( epred2_0 @ esk2_0 )
| ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_13,negated_conjecture,
( ( epred2_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) ),
inference(csr,[status(thm)],[c_0_10,c_0_9]) ).
thf(c_0_14,negated_conjecture,
epred1_0 @ esk2_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_8]),c_0_9]) ).
thf(c_0_15,negated_conjecture,
( ( epred2_0 @ esk1_0 )
| ( epred2_0 @ esk2_0 )
| ~ ( epred1_0 @ esk2_0 ) ),
inference(cn,[status(thm)],[c_0_12]) ).
thf(c_0_16,negated_conjecture,
! [X3: a] :
( ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ X3 )
| ~ ( epred2_0 @ X3 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_13]),c_0_14])]) ).
thf(c_0_17,negated_conjecture,
( ( epred2_0 @ esk2_0 )
| ( epred2_0 @ esk1_0 ) ),
inference(csr,[status(thm)],[c_0_15,c_0_8]) ).
thf(c_0_18,negated_conjecture,
epred1_0 @ esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_13]),c_0_14])]) ).
thf(c_0_19,negated_conjecture,
! [X3: a] :
( ( epred2_0 @ esk2_0 )
| ~ ( epred1_0 @ X3 )
| ~ ( epred2_0 @ X3 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_17]),c_0_18])]) ).
thf(c_0_20,negated_conjecture,
epred2_0 @ esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_17]),c_0_18])]) ).
thf(c_0_21,negated_conjecture,
! [X3: a] :
( ~ ( epred1_0 @ X3 )
| ~ ( epred2_0 @ X3 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_20]),c_0_14])]) ).
thf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_20]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SET611^5 : TPTP v8.2.0. Released v4.0.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n019.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 12:41:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.51 Running higher-order theorem proving
% 0.22/0.51 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/benchmark/theBenchmark.p
% 0.22/0.52 # Version: 3.1.0-ho
% 0.22/0.52 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.22/0.52 # Starting post_as_ho10 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_9 with 300s (1) cores
% 0.22/0.52 # Starting sh5l with 300s (1) cores
% 0.22/0.52 # post_as_ho10 with pid 31963 completed with status 0
% 0.22/0.52 # Result found by post_as_ho10
% 0.22/0.52 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.22/0.52 # Starting post_as_ho10 with 300s (1) cores
% 0.22/0.52 # No SInE strategy applied
% 0.22/0.52 # Search class: HGHNF-FFSF00-SSSFFFNN
% 0.22/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52 # Starting sh3 with 163s (1) cores
% 0.22/0.52 # sh3 with pid 31973 completed with status 0
% 0.22/0.52 # Result found by sh3
% 0.22/0.52 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.22/0.52 # Starting post_as_ho10 with 300s (1) cores
% 0.22/0.52 # No SInE strategy applied
% 0.22/0.52 # Search class: HGHNF-FFSF00-SSSFFFNN
% 0.22/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52 # Starting sh3 with 163s (1) cores
% 0.22/0.52 # Preprocessing time : 0.001 s
% 0.22/0.52 # Presaturation interreduction done
% 0.22/0.52
% 0.22/0.52 # Proof found!
% 0.22/0.52 # SZS status Theorem
% 0.22/0.52 # SZS output start CNFRefutation
% See solution above
% 0.22/0.52 # Parsed axioms : 2
% 0.22/0.52 # Removed by relevancy pruning/SinE : 0
% 0.22/0.52 # Initial clauses : 19
% 0.22/0.52 # Removed in clause preprocessing : 12
% 0.22/0.52 # Initial clauses in saturation : 7
% 0.22/0.52 # Processed clauses : 19
% 0.22/0.52 # ...of these trivial : 0
% 0.22/0.52 # ...subsumed : 2
% 0.22/0.52 # ...remaining for further processing : 17
% 0.22/0.52 # Other redundant clauses eliminated : 0
% 0.22/0.52 # Clauses deleted for lack of memory : 0
% 0.22/0.52 # Backward-subsumed : 1
% 0.22/0.52 # Backward-rewritten : 7
% 0.22/0.52 # Generated clauses : 11
% 0.22/0.52 # ...of the previous two non-redundant : 8
% 0.22/0.52 # ...aggressively subsumed : 0
% 0.22/0.52 # Contextual simplify-reflections : 4
% 0.22/0.52 # Paramodulations : 11
% 0.22/0.52 # Factorizations : 0
% 0.22/0.52 # NegExts : 0
% 0.22/0.52 # Equation resolutions : 0
% 0.22/0.52 # Disequality decompositions : 0
% 0.22/0.52 # Total rewrite steps : 13
% 0.22/0.52 # ...of those cached : 10
% 0.22/0.52 # Propositional unsat checks : 0
% 0.22/0.52 # Propositional check models : 0
% 0.22/0.52 # Propositional check unsatisfiable : 0
% 0.22/0.52 # Propositional clauses : 0
% 0.22/0.52 # Propositional clauses after purity: 0
% 0.22/0.52 # Propositional unsat core size : 0
% 0.22/0.52 # Propositional preprocessing time : 0.000
% 0.22/0.52 # Propositional encoding time : 0.000
% 0.22/0.52 # Propositional solver time : 0.000
% 0.22/0.52 # Success case prop preproc time : 0.000
% 0.22/0.52 # Success case prop encoding time : 0.000
% 0.22/0.52 # Success case prop solver time : 0.000
% 0.22/0.52 # Current number of processed clauses : 4
% 0.22/0.52 # Positive orientable unit clauses : 3
% 0.22/0.52 # Positive unorientable unit clauses: 0
% 0.22/0.52 # Negative unit clauses : 0
% 0.22/0.52 # Non-unit-clauses : 1
% 0.22/0.52 # Current number of unprocessed clauses: 0
% 0.22/0.52 # ...number of literals in the above : 0
% 0.22/0.52 # Current number of archived formulas : 0
% 0.22/0.52 # Current number of archived clauses : 13
% 0.22/0.52 # Clause-clause subsumption calls (NU) : 13
% 0.22/0.52 # Rec. Clause-clause subsumption calls : 12
% 0.22/0.52 # Non-unit clause-clause subsumptions : 7
% 0.22/0.52 # Unit Clause-clause subsumption calls : 1
% 0.22/0.52 # Rewrite failures with RHS unbound : 0
% 0.22/0.52 # BW rewrite match attempts : 3
% 0.22/0.52 # BW rewrite match successes : 3
% 0.22/0.52 # Condensation attempts : 0
% 0.22/0.52 # Condensation successes : 0
% 0.22/0.52 # Termbank termtop insertions : 1349
% 0.22/0.52 # Search garbage collected termcells : 354
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.004 s
% 0.22/0.52 # System time : 0.001 s
% 0.22/0.52 # Total time : 0.005 s
% 0.22/0.52 # Maximum resident set size: 1772 pages
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.005 s
% 0.22/0.52 # System time : 0.003 s
% 0.22/0.52 # Total time : 0.009 s
% 0.22/0.52 # Maximum resident set size: 1720 pages
% 0.22/0.52 % E---3.1 exiting
% 0.22/0.52 % E exiting
%------------------------------------------------------------------------------