TSTP Solution File: SEU797^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU797^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 03:30:19 EDT 2024
% Result : Theorem 0.18s 0.46s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 20 ( 4 unt; 8 typ; 0 def)
% Number of atoms : 39 ( 10 equ; 0 cnn)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 136 ( 11 ~; 8 |; 10 &; 98 @)
% ( 5 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 19 ( 19 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 40 ( 5 ^ 30 !; 5 ?; 40 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
image1: $i > ( $i > $i ) > $i ).
thf(decl_24,type,
image1Equiv: $o ).
thf(decl_25,type,
esk1_3: $i > ( $i > $i ) > $i > $i ).
thf(decl_26,type,
esk2_0: $i ).
thf(decl_27,type,
esk3_0: $i > $i ).
thf(decl_28,type,
esk4_0: $i ).
thf(decl_29,type,
esk5_0: $i ).
thf(image1Equiv,axiom,
( image1Equiv
<=> ! [X1: $i,X2: $i > $i,X3: $i] :
( ( in @ X3
@ ( image1 @ X1
@ ^ [X4: $i] : ( X2 @ X4 ) ) )
<=> ? [X4: $i] :
( ( in @ X4 @ X1 )
& ( X3
= ( X2 @ X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',image1Equiv) ).
thf(image1I,conjecture,
( image1Equiv
=> ! [X1: $i,X2: $i > $i,X3: $i] :
( ? [X4: $i] :
( ( in @ X4 @ X1 )
& ( X3
= ( X2 @ X4 ) ) )
=> ( in @ X3
@ ( image1 @ X1
@ ^ [X4: $i] : ( X2 @ X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',image1I) ).
thf(c_0_2,plain,
( image1Equiv
<=> ! [X1: $i,X2: $i > $i,X3: $i] :
( ( in @ X3
@ ( image1 @ X1
@ ^ [Z0: $i] : ( X2 @ Z0 ) ) )
<=> ? [X4: $i] :
( ( in @ X4 @ X1 )
& ( X3
= ( X2 @ X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[image1Equiv]) ).
thf(c_0_3,negated_conjecture,
~ ( ! [X13: $i,X14: $i > $i,X15: $i] :
( ( in @ X15
@ ( image1 @ X13
@ ^ [Z0: $i] : ( X14 @ Z0 ) ) )
<=> ? [X16: $i] :
( ( in @ X16 @ X13 )
& ( X15
= ( X14 @ X16 ) ) ) )
=> ! [X1: $i,X2: $i > $i,X3: $i] :
( ? [X4: $i] :
( ( in @ X4 @ X1 )
& ( X3
= ( X2 @ X4 ) ) )
=> ( in @ X3
@ ( image1 @ X1
@ ^ [Z0: $i] : ( X2 @ Z0 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[image1I])]),c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X17: $i,X18: $i > $i,X19: $i,X21: $i,X22: $i > $i,X23: $i,X24: $i] :
( ( ( in @ ( esk1_3 @ X17 @ X18 @ X19 ) @ X17 )
| ~ ( in @ X19 @ ( image1 @ X17 @ X18 ) ) )
& ( ( X19
= ( X18 @ ( esk1_3 @ X17 @ X18 @ X19 ) ) )
| ~ ( in @ X19 @ ( image1 @ X17 @ X18 ) ) )
& ( ~ ( in @ X24 @ X21 )
| ( X23
!= ( X22 @ X24 ) )
| ( in @ X23 @ ( image1 @ X21 @ X22 ) ) )
& ( in @ esk5_0 @ esk2_0 )
& ( esk4_0
= ( esk3_0 @ esk5_0 ) )
& ~ ( in @ esk4_0 @ ( image1 @ esk2_0 @ esk3_0 ) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])]) ).
thf(c_0_5,negated_conjecture,
! [X4: $i,X3: $i,X2: $i > $i,X1: $i] :
( ( in @ X4 @ ( image1 @ X3 @ X2 ) )
| ~ ( in @ X1 @ X3 )
| ( X4
!= ( X2 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X1: $i,X2: $i > $i,X3: $i] :
( ( in @ ( X2 @ X1 ) @ ( image1 @ X3 @ X2 ) )
| ~ ( in @ X1 @ X3 ) ),
inference(er,[status(thm)],[c_0_5]) ).
thf(c_0_7,negated_conjecture,
( esk4_0
= ( esk3_0 @ esk5_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
~ ( in @ esk4_0 @ ( image1 @ esk2_0 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i] :
( ( in @ esk4_0 @ ( image1 @ X1 @ esk3_0 ) )
| ~ ( in @ esk5_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_10,negated_conjecture,
in @ esk5_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU797^2 : TPTP v8.2.0. Released v3.7.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun May 19 17:53:53 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.18/0.46 Running higher-order theorem proving
% 0.18/0.46 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.18/0.46 # Version: 3.1.0-ho
% 0.18/0.46 # Preprocessing class: HSSSSMSSSLMNSSA.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting new_ho_10 with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.46 # Starting new_bool_2 with 300s (1) cores
% 0.18/0.46 # Starting new_bool_9 with 300s (1) cores
% 0.18/0.46 # new_bool_2 with pid 2841 completed with status 0
% 0.18/0.46 # Result found by new_bool_2
% 0.18/0.46 # Preprocessing class: HSSSSMSSSLMNSSA.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting new_ho_10 with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.46 # Starting new_bool_2 with 300s (1) cores
% 0.18/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.46 # Search class: HHUSF-FFSF32-SSSFMSNN
% 0.18/0.46 # partial match(2): HHUSF-FFSF32-SHSFMSBN
% 0.18/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 # Starting new_ho_10 with 163s (1) cores
% 0.18/0.46 # new_ho_10 with pid 2847 completed with status 0
% 0.18/0.46 # Result found by new_ho_10
% 0.18/0.46 # Preprocessing class: HSSSSMSSSLMNSSA.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting new_ho_10 with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.46 # Starting new_bool_2 with 300s (1) cores
% 0.18/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.46 # Search class: HHUSF-FFSF32-SSSFMSNN
% 0.18/0.46 # partial match(2): HHUSF-FFSF32-SHSFMSBN
% 0.18/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 # Starting new_ho_10 with 163s (1) cores
% 0.18/0.46 # Preprocessing time : 0.001 s
% 0.18/0.46 # Presaturation interreduction done
% 0.18/0.46
% 0.18/0.46 # Proof found!
% 0.18/0.46 # SZS status Theorem
% 0.18/0.46 # SZS output start CNFRefutation
% See solution above
% 0.18/0.46 # Parsed axioms : 5
% 0.18/0.46 # Removed by relevancy pruning/SinE : 3
% 0.18/0.46 # Initial clauses : 6
% 0.18/0.46 # Removed in clause preprocessing : 0
% 0.18/0.46 # Initial clauses in saturation : 6
% 0.18/0.46 # Processed clauses : 12
% 0.18/0.46 # ...of these trivial : 0
% 0.18/0.46 # ...subsumed : 0
% 0.18/0.46 # ...remaining for further processing : 12
% 0.18/0.46 # Other redundant clauses eliminated : 1
% 0.18/0.46 # Clauses deleted for lack of memory : 0
% 0.18/0.46 # Backward-subsumed : 0
% 0.18/0.46 # Backward-rewritten : 0
% 0.18/0.46 # Generated clauses : 3
% 0.18/0.46 # ...of the previous two non-redundant : 2
% 0.18/0.46 # ...aggressively subsumed : 0
% 0.18/0.46 # Contextual simplify-reflections : 0
% 0.18/0.46 # Paramodulations : 2
% 0.18/0.46 # Factorizations : 0
% 0.18/0.46 # NegExts : 0
% 0.18/0.46 # Equation resolutions : 1
% 0.18/0.46 # Disequality decompositions : 0
% 0.18/0.46 # Total rewrite steps : 1
% 0.18/0.46 # ...of those cached : 0
% 0.18/0.46 # Propositional unsat checks : 0
% 0.18/0.46 # Propositional check models : 0
% 0.18/0.46 # Propositional check unsatisfiable : 0
% 0.18/0.46 # Propositional clauses : 0
% 0.18/0.46 # Propositional clauses after purity: 0
% 0.18/0.46 # Propositional unsat core size : 0
% 0.18/0.46 # Propositional preprocessing time : 0.000
% 0.18/0.46 # Propositional encoding time : 0.000
% 0.18/0.46 # Propositional solver time : 0.000
% 0.18/0.46 # Success case prop preproc time : 0.000
% 0.18/0.46 # Success case prop encoding time : 0.000
% 0.18/0.46 # Success case prop solver time : 0.000
% 0.18/0.46 # Current number of processed clauses : 5
% 0.18/0.46 # Positive orientable unit clauses : 2
% 0.18/0.46 # Positive unorientable unit clauses: 0
% 0.18/0.46 # Negative unit clauses : 1
% 0.18/0.46 # Non-unit-clauses : 2
% 0.18/0.46 # Current number of unprocessed clauses: 2
% 0.18/0.46 # ...number of literals in the above : 4
% 0.18/0.46 # Current number of archived formulas : 0
% 0.18/0.46 # Current number of archived clauses : 6
% 0.18/0.46 # Clause-clause subsumption calls (NU) : 2
% 0.18/0.46 # Rec. Clause-clause subsumption calls : 2
% 0.18/0.46 # Non-unit clause-clause subsumptions : 0
% 0.18/0.46 # Unit Clause-clause subsumption calls : 0
% 0.18/0.46 # Rewrite failures with RHS unbound : 0
% 0.18/0.46 # BW rewrite match attempts : 0
% 0.18/0.46 # BW rewrite match successes : 0
% 0.18/0.46 # Condensation attempts : 12
% 0.18/0.46 # Condensation successes : 0
% 0.18/0.46 # Termbank termtop insertions : 617
% 0.18/0.46 # Search garbage collected termcells : 218
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.001 s
% 0.18/0.46 # System time : 0.003 s
% 0.18/0.46 # Total time : 0.004 s
% 0.18/0.46 # Maximum resident set size: 1784 pages
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.002 s
% 0.18/0.46 # System time : 0.004 s
% 0.18/0.46 # Total time : 0.006 s
% 0.18/0.46 # Maximum resident set size: 1716 pages
% 0.18/0.47 % E---3.1 exiting
% 0.18/0.47 % E exiting
%------------------------------------------------------------------------------