TSTP Solution File: QUA004^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : QUA004^1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:30:20 EDT 2024
% Result : Theorem 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 22 ( 17 unt; 5 typ; 0 def)
% Number of atoms : 38 ( 29 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 33 ( 4 ~; 7 |; 0 &; 22 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 15 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 31 ( 25 ^ 6 !; 0 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_24,type,
singleton: $i > $i > $o ).
thf(decl_26,type,
sup: ( $i > $o ) > $i ).
thf(decl_29,type,
addition: $i > $i > $i ).
thf(decl_34,type,
esk1_0: $i ).
thf(addition_def,axiom,
( addition
= ( ^ [X1: $i,X7: $i] : ( sup @ ( union @ ( singleton @ X1 ) @ ( singleton @ X7 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/QUA001^0.ax',addition_def) ).
thf(union_def,axiom,
( union
= ( ^ [X2: $i > $o,X3: $i > $o,X4: $i] :
( ( X2 @ X4 )
| ( X3 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/QUA001^0.ax',union_def) ).
thf(singleton_def,axiom,
( singleton
= ( ^ [X1: $i,X4: $i] : ( X4 = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/QUA001^0.ax',singleton_def) ).
thf(addition_idemp,conjecture,
! [X8: $i] :
( ( addition @ X8 @ X8 )
= X8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addition_idemp) ).
thf(sup_singleset,axiom,
! [X1: $i] :
( ( sup @ ( singleton @ X1 ) )
= X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/QUA001^0.ax',sup_singleset) ).
thf(c_0_5,plain,
( addition
= ( ^ [Z0: $i,Z1: $i] :
( sup
@ ^ [Z2: $i] :
( ( Z2 = Z0 )
| Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[addition_def]) ).
thf(c_0_6,plain,
( union
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[union_def]) ).
thf(c_0_7,plain,
( singleton
= ( ^ [Z0: $i,Z1: $i] : Z1 ) ),
inference(fof_simplification,[status(thm)],[singleton_def]) ).
thf(c_0_8,plain,
( addition
= ( ^ [Z0: $i,Z1: $i] :
( sup
@ ^ [Z2: $i] :
( ( Z2 = Z0 )
| Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
thf(c_0_9,negated_conjecture,
~ ! [X8: $i] :
( ( sup
@ ^ [Z0: $i] :
( ( Z0 = X8 )
| ( Z0 = X8 ) ) )
= X8 ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[addition_idemp]),c_0_8]) ).
thf(c_0_10,negated_conjecture,
( ( sup
@ ^ [Z0: $i] :
( ( Z0 = esk1_0 )
| ( Z0 = esk1_0 ) ) )
!= esk1_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
thf(c_0_11,plain,
! [X1: $i] :
( ( sup
@ ^ [Z0: $i] : ( Z0 = X1 ) )
= X1 ),
inference(apply_def,[status(thm)],[sup_singleset,c_0_7]) ).
thf(c_0_12,negated_conjecture,
( ( sup
@ ^ [Z0: $i] :
( ( Z0 = esk1_0 )
| ( Z0 = esk1_0 ) ) )
!= esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_13,plain,
! [X30: $i] :
( ( sup
@ ^ [Z0: $i] : ( Z0 = X30 ) )
= X30 ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
thf(c_0_14,negated_conjecture,
( ( sup
@ ^ [Z0: $i] : ( Z0 = esk1_0 ) )
!= esk1_0 ),
inference(cn,[status(thm)],[c_0_12]) ).
thf(c_0_15,plain,
! [X1: $i] :
( ( sup
@ ^ [Z0: $i] : ( Z0 = X1 ) )
= X1 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : QUA004^1 : TPTP v8.2.0. Released v4.1.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n009.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 : Mon May 20 13:36:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.48 Running higher-order theorem proving
% 0.19/0.48 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.50 # Version: 3.1.0-ho
% 0.19/0.50 # Preprocessing class: HSSSSMSSSLSCHFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.19/0.50 # Starting sh2lt with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # Starting pre_casc_6 with 300s (1) cores
% 0.19/0.50 # sh5l with pid 28662 completed with status 0
% 0.19/0.50 # Result found by sh5l
% 0.19/0.50 # Preprocessing class: HSSSSMSSSLSCHFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.19/0.50 # Starting sh2lt with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.50 # Search class: HHUSM-FFSF21-DHFFMFBN
% 0.19/0.50 # partial match(3): HHUSM-FFSF21-MSFSMFBN
% 0.19/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting new_ho_10 with 181s (1) cores
% 0.19/0.50 # new_ho_10 with pid 28670 completed with status 0
% 0.19/0.50 # Result found by new_ho_10
% 0.19/0.50 # Preprocessing class: HSSSSMSSSLSCHFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.19/0.50 # Starting sh2lt with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.50 # Search class: HHUSM-FFSF21-DHFFMFBN
% 0.19/0.50 # partial match(3): HHUSM-FFSF21-MSFSMFBN
% 0.19/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting new_ho_10 with 181s (1) cores
% 0.19/0.50 # Preprocessing time : 0.001 s
% 0.19/0.50 # Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 # Proof found!
% 0.19/0.50 # SZS status Theorem
% 0.19/0.50 # SZS output start CNFRefutation
% See solution above
% 0.19/0.50 # Parsed axioms : 27
% 0.19/0.50 # Removed by relevancy pruning/SinE : 14
% 0.19/0.50 # Initial clauses : 8
% 0.19/0.50 # Removed in clause preprocessing : 0
% 0.19/0.50 # Initial clauses in saturation : 8
% 0.19/0.50 # Processed clauses : 4
% 0.19/0.50 # ...of these trivial : 0
% 0.19/0.50 # ...subsumed : 0
% 0.19/0.50 # ...remaining for further processing : 4
% 0.19/0.50 # Other redundant clauses eliminated : 0
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 0
% 0.19/0.50 # Backward-rewritten : 1
% 0.19/0.50 # Generated clauses : 0
% 0.19/0.50 # ...of the previous two non-redundant : 0
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 0
% 0.19/0.50 # Paramodulations : 0
% 0.19/0.50 # Factorizations : 0
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 0
% 0.19/0.50 # Disequality decompositions : 0
% 0.19/0.50 # Total rewrite steps : 1
% 0.19/0.50 # ...of those cached : 0
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 3
% 0.19/0.50 # Positive orientable unit clauses : 3
% 0.19/0.50 # Positive unorientable unit clauses: 0
% 0.19/0.50 # Negative unit clauses : 0
% 0.19/0.50 # Non-unit-clauses : 0
% 0.19/0.50 # Current number of unprocessed clauses: 4
% 0.19/0.50 # ...number of literals in the above : 6
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 1
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.50 # Non-unit clause-clause subsumptions : 0
% 0.19/0.50 # Unit Clause-clause subsumption calls : 0
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 1
% 0.19/0.50 # BW rewrite match successes : 1
% 0.19/0.50 # Condensation attempts : 4
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 831
% 0.19/0.50 # Search garbage collected termcells : 192
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.006 s
% 0.19/0.50 # System time : 0.000 s
% 0.19/0.50 # Total time : 0.006 s
% 0.19/0.50 # Maximum resident set size: 1884 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.006 s
% 0.19/0.50 # System time : 0.002 s
% 0.19/0.50 # Total time : 0.008 s
% 0.19/0.50 # Maximum resident set size: 1760 pages
% 0.19/0.50 % E---3.1 exiting
% 0.19/0.50 % E exiting
%------------------------------------------------------------------------------