TSTP Solution File: SYO033^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO033^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:44:18 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 2 unt; 3 typ; 0 def)
% Number of atoms : 20 ( 0 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 81 ( 10 ~; 9 |; 1 &; 59 @)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 32 ( 32 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 45 ( 13 ^ 30 !; 2 ?; 45 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
epred1_1: ( ( $i > $o ) > $o ) > $i > $o ).
thf(decl_23,type,
esk1_1: ( ( $i > $o ) > $o ) > $i ).
thf(decl_24,type,
esk2_0: $i ).
thf(conj,conjecture,
? [X1: ( $i > $o ) > $o] :
! [X2: $i > $o] :
( ( X1 @ X2 )
<=> ! [X3: $i] : ( X2 @ X3 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(c_0_1,negated_conjecture,
~ ? [X1: ( $i > $o ) > $o] :
! [X2: $i > $o] :
( ( X1 @ X2 )
<=> ! [X3: $i] : ( X2 @ X3 ) ),
inference(assume_negation,[status(cth)],[conj]) ).
thf(c_0_2,negated_conjecture,
! [X7: ( $i > $o ) > $o,X10: $i] :
( ( ~ ( X7 @ ( epred1_1 @ X7 ) )
| ~ ( epred1_1 @ X7 @ ( esk1_1 @ X7 ) ) )
& ( ( X7 @ ( epred1_1 @ X7 ) )
| ( epred1_1 @ X7 @ X10 ) ) ),
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: ( $i > $o ) > $o,X3: $i] :
( ( X1 @ ( epred1_1 @ X1 ) )
| ( epred1_1 @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X3: $i] :
( ! [X44: $i] :
( epred1_1
@ ^ [Z0: $i > $o] :
! [X45: $i] : ( Z0 @ X45 )
@ X44 )
| ( epred1_1
@ ^ [Z0: $i > $o] :
! [X46: $i] : ( Z0 @ X46 )
@ X3 ) ),
inference(primitive_enumeration,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X1: ( $i > $o ) > $o] :
( ~ ( X1 @ ( epred1_1 @ X1 ) )
| ~ ( epred1_1 @ X1 @ ( esk1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X3: $i,X6: $i] :
( ( epred1_1
@ ^ [Z0: $i > $o] :
! [X47: $i] : ( Z0 @ X47 )
@ X3 )
| ( epred1_1
@ ^ [Z0: $i > $o] :
! [X48: $i] : ( Z0 @ X48 )
@ X6 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
( ~ ( epred1_1
@ ^ [Z0: $i > $o] :
! [X49: $i] : ( Z0 @ X49 )
@ ( esk1_1
@ ^ [Z0: $i > $o] :
! [X50: $i] : ( Z0 @ X50 ) ) )
| ~ ! [X51: $i] :
( epred1_1
@ ^ [Z0: $i > $o] :
! [X52: $i] : ( Z0 @ X52 )
@ X51 ) ),
inference(primitive_enumeration,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X3: $i] :
( ( epred1_1
@ ^ [Z0: $i > $o] :
! [X53: $i] : ( Z0 @ X53 )
@ X3 )
| ~ ! [X54: $i] :
( epred1_1
@ ^ [Z0: $i > $o] :
! [X55: $i] : ( Z0 @ X55 )
@ X54 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,negated_conjecture,
( ~ ( epred1_1
@ ^ [Z0: $i > $o] :
! [X56: $i] : ( Z0 @ X56 )
@ ( esk1_1
@ ^ [Z0: $i > $o] :
! [X57: $i] : ( Z0 @ X57 ) ) )
| ~ ( epred1_1
@ ^ [Z0: $i > $o] :
! [X58: $i] : ( Z0 @ X58 )
@ esk2_0 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X3: $i] :
( epred1_1
@ ^ [Z0: $i > $o] :
! [X59: $i] : ( Z0 @ X59 )
@ X3 ),
inference(csr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_8]),c_0_6]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO033^1 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n027.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 10:17:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 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.20/0.49 # Version: 3.1.0-ho
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.49 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting sh2lt with 1200s (4) cores
% 0.20/0.49 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.49 # Starting full_lambda_6 with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.49 # Starting ehoh_best3_rw with 300s (1) cores
% 0.20/0.49 # sh2lt with pid 19991 completed with status 0
% 0.20/0.49 # Result found by sh2lt
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.49 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting sh2lt with 1200s (4) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.20/0.49 # Search class: HGHNF-FFSF11-SHHFFMBN
% 0.20/0.49 # Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 0.20/0.49 # Starting ehoh_best_nonlift with 649s (1) cores
% 0.20/0.49 # Starting sh2lt with 121s (1) cores
% 0.20/0.49 # Starting ehoh_best_sine_rwall with 109s (1) cores
% 0.20/0.49 # Starting lpo1_def_fix with 109s (1) cores
% 0.20/0.49 # sh2lt with pid 19998 completed with status 0
% 0.20/0.49 # Result found by sh2lt
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.49 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting sh2lt with 1200s (4) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.20/0.49 # Search class: HGHNF-FFSF11-SHHFFMBN
% 0.20/0.49 # Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 0.20/0.49 # Starting ehoh_best_nonlift with 649s (1) cores
% 0.20/0.49 # Starting sh2lt with 121s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 1
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 2
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 2
% 0.20/0.49 # Processed clauses : 22
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 2
% 0.20/0.49 # ...remaining for further processing : 20
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 1
% 0.20/0.49 # Backward-rewritten : 3
% 0.20/0.49 # Generated clauses : 28
% 0.20/0.49 # ...of the previous two non-redundant : 24
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 2
% 0.20/0.49 # Paramodulations : 11
% 0.20/0.49 # Factorizations : 2
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 5
% 0.20/0.49 # ...of those cached : 0
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 7
% 0.20/0.49 # Positive orientable unit clauses : 3
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 1
% 0.20/0.49 # Non-unit-clauses : 3
% 0.20/0.49 # Current number of unprocessed clauses: 6
% 0.20/0.49 # ...number of literals in the above : 10
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 13
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 29
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 27
% 0.20/0.49 # Non-unit clause-clause subsumptions : 4
% 0.20/0.49 # Unit Clause-clause subsumption calls : 1
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 9
% 0.20/0.49 # BW rewrite match successes : 5
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 3324
% 0.20/0.49 # Search garbage collected termcells : 76
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.004 s
% 0.20/0.49 # System time : 0.002 s
% 0.20/0.49 # Total time : 0.006 s
% 0.20/0.49 # Maximum resident set size: 1784 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.015 s
% 0.20/0.49 # System time : 0.008 s
% 0.20/0.49 # Total time : 0.023 s
% 0.20/0.49 # Maximum resident set size: 1700 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------