TSTP Solution File: SYO357^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO357^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 08:45:42 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 15 ( 5 unt; 6 typ; 0 def)
% Number of atoms : 23 ( 0 equ; 0 cnn)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 77 ( 19 ~; 19 |; 9 &; 24 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 5 usr; 5 con; 0-1 aty)
% Number of variables : 8 ( 0 ^ 8 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
atype: $tType ).
thf(decl_22,type,
a: $o ).
thf(decl_23,type,
v: atype ).
thf(decl_24,type,
u: atype ).
thf(decl_25,type,
b: $o ).
thf(decl_26,type,
epred1_0: atype > $o ).
thf(cE2LEIBEQ2_pme,conjecture,
( ! [X1: atype > $o] :
( ( ( a
| ~ a )
& ( X1 @ u ) )
=> ( ( b
| ~ b )
& ( X1 @ v ) ) )
=> ! [X2: atype > $o] :
( ( X2 @ u )
=> ( X2 @ v ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cE2LEIBEQ2_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ! [X1: atype > $o] :
( ( ( a
| ~ a )
& ( X1 @ u ) )
=> ( ( b
| ~ b )
& ( X1 @ v ) ) )
=> ! [X2: atype > $o] :
( ( X2 @ u )
=> ( X2 @ v ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cE2LEIBEQ2_pme])]) ).
thf(c_0_2,negated_conjecture,
! [X5: atype > $o] :
( ( b
| ~ b
| ~ a
| ~ ( X5 @ u ) )
& ( ( X5 @ v )
| ~ a
| ~ ( X5 @ u ) )
& ( b
| ~ b
| a
| ~ ( X5 @ u ) )
& ( ( X5 @ v )
| a
| ~ ( X5 @ u ) )
& ( epred1_0 @ u )
& ~ ( epred1_0 @ v ) ),
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: atype > $o] :
( ( X1 @ v )
| a
| ~ ( X1 @ u ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: atype > $o] :
( ( X1 @ v )
| ~ a
| ~ ( X1 @ u ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X1: atype > $o] :
( ( X1 @ v )
| ~ ( X1 @ u ) ),
inference(csr,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_6,negated_conjecture,
epred1_0 @ u,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
~ ( epred1_0 @ v ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYO357^5 : TPTP v8.2.0. Released v4.0.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n003.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 08:31:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running higher-order theorem proving
% 0.20/0.49 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.20/0.50 # Version: 3.1.0-ho
% 0.20/0.50 # Preprocessing class: HSSSSLSSSSSNSSA.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.50 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # ehoh_best_sine_rwall with pid 19858 completed with status 0
% 0.20/0.50 # Result found by ehoh_best_sine_rwall
% 0.20/0.50 # Preprocessing class: HSSSSLSSSSSNSSA.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.50 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.20/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.50 # Search class: HGUNF-FFSF00-SSSFFMBN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting ehoh_best_nonlift with 163s (1) cores
% 0.20/0.50 # ehoh_best_nonlift with pid 19861 completed with status 0
% 0.20/0.50 # Result found by ehoh_best_nonlift
% 0.20/0.50 # Preprocessing class: HSSSSLSSSSSNSSA.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.50 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.20/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.50 # Search class: HGUNF-FFSF00-SSSFFMBN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting ehoh_best_nonlift with 163s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 6
% 0.20/0.50 # Removed by relevancy pruning/SinE : 5
% 0.20/0.50 # Initial clauses : 6
% 0.20/0.50 # Removed in clause preprocessing : 2
% 0.20/0.50 # Initial clauses in saturation : 4
% 0.20/0.50 # Processed clauses : 7
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 0
% 0.20/0.50 # ...remaining for further processing : 7
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 1
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 5
% 0.20/0.50 # ...of the previous two non-redundant : 2
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 1
% 0.20/0.50 # Paramodulations : 1
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 0
% 0.20/0.50 # ...of those cached : 0
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 3
% 0.20/0.50 # Positive orientable unit clauses : 1
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 1
% 0.20/0.50 # Non-unit-clauses : 1
% 0.20/0.50 # Current number of unprocessed clauses: 0
% 0.20/0.50 # ...number of literals in the above : 0
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 4
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 2
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 2
% 0.20/0.50 # Non-unit clause-clause subsumptions : 2
% 0.20/0.50 # Unit Clause-clause subsumption calls : 0
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 0
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 489
% 0.20/0.50 # Search garbage collected termcells : 121
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.005 s
% 0.20/0.50 # System time : 0.000 s
% 0.20/0.50 # Total time : 0.005 s
% 0.20/0.50 # Maximum resident set size: 1780 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.006 s
% 0.20/0.50 # System time : 0.002 s
% 0.20/0.50 # Total time : 0.007 s
% 0.20/0.50 # Maximum resident set size: 1720 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------