TSTP Solution File: SEU460^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU460^1 : TPTP v8.2.0. Released v3.6.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:27:29 EDT 2024
% Result : Theorem 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 24 ( 12 unt; 7 typ; 0 def)
% Number of atoms : 33 ( 7 equ; 0 cnn)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 114 ( 8 ~; 8 |; 3 &; 83 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 64 ( 64 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 41 ( 13 ^ 28 !; 0 ?; 41 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
subrel: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
thf(decl_26,type,
mono: ( ( $i > $i > $o ) > $i > $i > $o ) > $o ).
thf(decl_33,type,
sc: ( $i > $i > $o ) > $i > $i > $o ).
thf(decl_51,type,
epred1_0: $i > $i > $o ).
thf(decl_52,type,
epred2_0: $i > $i > $o ).
thf(decl_53,type,
esk1_0: $i ).
thf(decl_54,type,
esk2_0: $i ).
thf(monotonic,axiom,
( mono
= ( ^ [X5: ( $i > $i > $o ) > $i > $i > $o] :
! [X1: $i > $i > $o,X2: $i > $i > $o] :
( ( subrel @ X1 @ X2 )
=> ( subrel @ ( X5 @ X1 ) @ ( X5 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET009^0.ax',monotonic) ).
thf(subrel,axiom,
( subrel
= ( ^ [X1: $i > $i > $o,X2: $i > $i > $o] :
! [X3: $i,X4: $i] :
( ( X1 @ X3 @ X4 )
=> ( X2 @ X3 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET009^0.ax',subrel) ).
thf(symmetric_closure,axiom,
( sc
= ( ^ [X1: $i > $i > $o,X3: $i,X4: $i] :
( ( X1 @ X4 @ X3 )
| ( X1 @ X3 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET009^0.ax',symmetric_closure) ).
thf(symmetric_closure_op_is_monotonic,conjecture,
mono @ sc,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetric_closure_op_is_monotonic) ).
thf(c_0_4,plain,
( mono
= ( ^ [Z0: ( $i > $i > $o ) > $i > $i > $o] :
! [X1: $i > $i > $o,X2: $i > $i > $o] :
( ! [X9: $i,X10: $i] :
( ( X1 @ X9 @ X10 )
=> ( X2 @ X9 @ X10 ) )
=> ! [X11: $i,X12: $i] :
( ( Z0 @ X1 @ X11 @ X12 )
=> ( Z0 @ X2 @ X11 @ X12 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[monotonic]) ).
thf(c_0_5,plain,
( subrel
= ( ^ [Z0: $i > $i > $o,Z1: $i > $i > $o] :
! [X3: $i,X4: $i] :
( ( Z0 @ X3 @ X4 )
=> ( Z1 @ X3 @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[subrel]) ).
thf(c_0_6,plain,
( sc
= ( ^ [Z0: $i > $i > $o,Z1: $i,Z2: $i] :
( ( Z0 @ Z2 @ Z1 )
| ( Z0 @ Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[symmetric_closure]) ).
thf(c_0_7,plain,
( mono
= ( ^ [Z0: ( $i > $i > $o ) > $i > $i > $o] :
! [X1: $i > $i > $o,X2: $i > $i > $o] :
( ! [X9: $i,X10: $i] :
( ( X1 @ X9 @ X10 )
=> ( X2 @ X9 @ X10 ) )
=> ! [X11: $i,X12: $i] :
( ( Z0 @ X1 @ X11 @ X12 )
=> ( Z0 @ X2 @ X11 @ X12 ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_8,negated_conjecture,
~ ! [X81: $i > $i > $o,X82: $i > $i > $o] :
( ! [X83: $i,X84: $i] :
( ( X81 @ X83 @ X84 )
=> ( X82 @ X83 @ X84 ) )
=> ! [X85: $i,X86: $i] :
( ( ( X81 @ X86 @ X85 )
| ( X81 @ X85 @ X86 ) )
=> ( ( X82 @ X86 @ X85 )
| ( X82 @ X85 @ X86 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[symmetric_closure_op_is_monotonic]),c_0_6]),c_0_7]) ).
thf(c_0_9,negated_conjecture,
! [X89: $i,X90: $i] :
( ( ~ ( epred1_0 @ X89 @ X90 )
| ( epred2_0 @ X89 @ X90 ) )
& ( ( epred1_0 @ esk2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 ) )
& ~ ( epred2_0 @ esk2_0 @ esk1_0 )
& ~ ( epred2_0 @ esk1_0 @ esk2_0 ) ),
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_8])])])])]) ).
thf(c_0_10,negated_conjecture,
~ ( epred2_0 @ esk2_0 @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_11,negated_conjecture,
! [X3: $i,X4: $i] :
( ( epred2_0 @ X3 @ X4 )
| ~ ( epred1_0 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_12,negated_conjecture,
( ( epred1_0 @ esk2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_13,negated_conjecture,
~ ( epred1_0 @ esk2_0 @ esk1_0 ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_14,negated_conjecture,
~ ( epred2_0 @ esk1_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_15,negated_conjecture,
epred1_0 @ esk1_0 @ esk2_0,
inference(sr,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_11]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU460^1 : TPTP v8.2.0. Released v3.6.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 15:41:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running higher-order theorem proving
% 0.19/0.47 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.19/0.49 # Version: 3.1.0-ho
% 0.19/0.49 # Preprocessing class: HSSSSMSSMLSNHHN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.49 # Starting pre_casc_5 with 300s (1) cores
% 0.19/0.49 # Starting post_as_ho11 with 300s (1) cores
% 0.19/0.49 # Starting ho_unfolding_1 with 300s (1) cores
% 0.19/0.49 # pre_casc_5 with pid 7198 completed with status 0
% 0.19/0.49 # Result found by pre_casc_5
% 0.19/0.49 # Preprocessing class: HSSSSMSSMLSNHHN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.49 # Starting pre_casc_5 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,3,,5,20000,1.0,true)
% 0.19/0.49 # Search class: HGUNF-FFSF00-SHHSMFNN
% 0.19/0.49 # partial match(1): HGUNF-FFSF00-SHSSMFNN
% 0.19/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.49 # new_ho_10 with pid 7201 completed with status 0
% 0.19/0.49 # Result found by new_ho_10
% 0.19/0.49 # Preprocessing class: HSSSSMSSMLSNHHN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.49 # Starting pre_casc_5 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,3,,5,20000,1.0,true)
% 0.19/0.49 # Search class: HGUNF-FFSF00-SHHSMFNN
% 0.19/0.49 # partial match(1): HGUNF-FFSF00-SHSSMFNN
% 0.19/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.49 # Preprocessing time : 0.001 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Theorem
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 59
% 0.19/0.49 # Removed by relevancy pruning/SinE : 45
% 0.19/0.49 # Initial clauses : 4
% 0.19/0.49 # Removed in clause preprocessing : 0
% 0.19/0.49 # Initial clauses in saturation : 4
% 0.19/0.49 # Processed clauses : 11
% 0.19/0.49 # ...of these trivial : 0
% 0.19/0.49 # ...subsumed : 0
% 0.19/0.49 # ...remaining for further processing : 10
% 0.19/0.49 # Other redundant clauses eliminated : 0
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 0
% 0.19/0.49 # Backward-rewritten : 0
% 0.19/0.49 # Generated clauses : 3
% 0.19/0.49 # ...of the previous two non-redundant : 3
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 0
% 0.19/0.49 # Paramodulations : 2
% 0.19/0.49 # Factorizations : 0
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 0
% 0.19/0.49 # Disequality decompositions : 0
% 0.19/0.49 # Total rewrite steps : 1
% 0.19/0.49 # ...of those cached : 0
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 5
% 0.19/0.49 # Positive orientable unit clauses : 1
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 3
% 0.19/0.49 # Non-unit-clauses : 1
% 0.19/0.49 # Current number of unprocessed clauses: 0
% 0.19/0.49 # ...number of literals in the above : 0
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 5
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.49 # Non-unit clause-clause subsumptions : 0
% 0.19/0.49 # Unit Clause-clause subsumption calls : 2
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 0
% 0.19/0.49 # BW rewrite match successes : 0
% 0.19/0.49 # Condensation attempts : 11
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 1677
% 0.19/0.49 # Search garbage collected termcells : 585
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.003 s
% 0.19/0.49 # System time : 0.003 s
% 0.19/0.49 # Total time : 0.006 s
% 0.19/0.49 # Maximum resident set size: 2096 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.006 s
% 0.19/0.49 # System time : 0.005 s
% 0.19/0.49 # Total time : 0.010 s
% 0.19/0.49 # Maximum resident set size: 1788 pages
% 0.19/0.49 % E---3.1 exiting
% 0.19/0.49 % E exiting
%------------------------------------------------------------------------------