TSTP Solution File: SYO026^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO026^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:16 EDT 2024
% Result : Theorem 0.11s 0.35s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 8 unt; 6 typ; 0 def)
% Number of atoms : 82 ( 4 equ; 0 cnn)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 84 ( 32 ~; 8 |; 10 &; 29 @)
% ( 0 <=>; 2 =>; 0 <=; 3 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 6 usr; 7 con; 0-2 aty)
% Number of variables : 19 ( 17 ^ 2 !; 0 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
p: ( $o > $o ) > $o ).
thf(decl_23,type,
epred1_0: $o > $o ).
thf(decl_24,type,
esk1_0: $o ).
thf(decl_25,type,
esk2_0: $o ).
thf(decl_26,type,
esk3_0: $o ).
thf(decl_27,type,
esk4_0: $o ).
thf(conj,conjecture,
( ( ( p
@ ^ [X1: $o] : X1 )
& ( p
@ ^ [X1: $o] : ~ X1 )
& ( p
@ ^ [X1: $o] : ~ $true )
& ( p
@ ^ [X1: $o] : $true ) )
=> ! [X2: $o > $o] : ( p @ X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(c_0_1,negated_conjecture,
~ ( ( ( p
@ ^ [Z0: $o] : Z0 )
& ( p @ $not )
& ( p
@ ^ [Z0: $o] : ~ $true )
& ( p
@ ^ [Z0: $o] : $true ) )
=> ! [X2: $o > $o] : ( p @ X2 ) ),
inference(fool_unroll,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])])]) ).
thf(c_0_2,negated_conjecture,
( ( p
@ ^ [Z0: $o] : Z0 )
& ( p @ $not )
& ( p
@ ^ [Z0: $o] : ~ $true )
& ( p
@ ^ [Z0: $o] : $true )
& ~ ( p @ epred1_0 ) ),
inference(fof_nnf,[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,
~ ( p @ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( p
@ ^ [Z0: $o] : Z0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
p @ $not,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
( p
@ ^ [Z0: $o] : ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,plain,
( ( ^ [Z0: $o] : Z0 )
!= epred1_0 ),
inference(ext_sup,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_8,plain,
$not != epred1_0,
inference(ext_sup,[status(thm)],[c_0_3,c_0_5]) ).
thf(c_0_9,negated_conjecture,
( p
@ ^ [Z0: $o] : ~ $true ),
inference(cn,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
( p
@ ^ [Z0: $o] : $true ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,plain,
( ( epred1_0 @ esk4_0 )
<~> esk4_0 ),
inference(neg_ext,[status(thm)],[c_0_7]) ).
thf(c_0_12,plain,
( ~ esk1_0
<~> ( epred1_0 @ esk1_0 ) ),
inference(neg_ext,[status(thm)],[c_0_8]) ).
thf(c_0_13,plain,
( ( ^ [Z0: $o] : ~ $true )
!= epred1_0 ),
inference(ext_sup,[status(thm)],[c_0_3,c_0_9]) ).
thf(c_0_14,plain,
( ( ^ [Z0: $o] : $true )
!= epred1_0 ),
inference(ext_sup,[status(thm)],[c_0_3,c_0_10]) ).
thf(c_0_15,plain,
( ~ ( epred1_0 @ $true )
| ~ esk4_0 ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_11])]) ).
thf(c_0_16,plain,
( ( epred1_0 @ $true )
| ~ esk1_0 ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_12])]) ).
thf(c_0_17,plain,
( esk1_0
| ~ ( epred1_0 @ ~ $true ) ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_12])]) ).
thf(c_0_18,plain,
epred1_0 @ esk3_0,
inference(neg_ext,[status(thm)],[c_0_13]) ).
thf(c_0_19,plain,
~ ( epred1_0 @ esk2_0 ),
inference(neg_ext,[status(thm)],[c_0_14]) ).
thf(c_0_20,plain,
( ~ esk4_0
| ~ esk1_0 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_21,plain,
( esk1_0
| esk3_0 ),
inference(ext_sup,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_22,plain,
( ~ esk3_0
| ~ esk4_0 ),
inference(ext_sup,[status(thm)],[c_0_15,c_0_18]) ).
thf(c_0_23,plain,
( esk2_0
<~> esk3_0 ),
inference(ext_sup,[status(thm)],[c_0_19,c_0_18]) ).
thf(c_0_24,plain,
~ esk4_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
thf(c_0_25,plain,
( ~ esk2_0
| ~ esk1_0 ),
inference(ext_sup,[status(thm)],[c_0_19,c_0_16]) ).
thf(c_0_26,plain,
( ~ esk2_0
| ~ esk3_0 ),
inference(dynamic_cnf,[status(thm)],[c_0_23]) ).
thf(c_0_27,plain,
epred1_0 @ ~ $true,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_11])]),c_0_24]) ).
thf(c_0_28,plain,
~ esk2_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_21]),c_0_26]) ).
thf(c_0_29,plain,
$false,
inference(sr,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_19,c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.07 % Problem : SYO026^1 : TPTP v8.2.0. Released v3.7.0.
% 0.04/0.08 % Command : run_E %s %d THM
% 0.07/0.27 % Computer : n006.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Mon May 20 10:34:22 EDT 2024
% 0.07/0.27 % CPUTime :
% 0.11/0.34 Running higher-order theorem proving
% 0.11/0.34 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.11/0.35 # Version: 3.1.0-ho
% 0.11/0.35 # Preprocessing class: HSSSSMSSSSMCSSN.
% 0.11/0.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.35 # Starting post_as_ho5 with 1500s (5) cores
% 0.11/0.35 # Starting sh5l with 300s (1) cores
% 0.11/0.35 # Starting post_as_ho10 with 300s (1) cores
% 0.11/0.35 # Starting post_as_ho4 with 300s (1) cores
% 0.11/0.35 # post_as_ho5 with pid 14754 completed with status 0
% 0.11/0.35 # Result found by post_as_ho5
% 0.11/0.35 # Preprocessing class: HSSSSMSSSSMCSSN.
% 0.11/0.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.35 # Starting post_as_ho5 with 1500s (5) cores
% 0.11/0.35 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.11/0.35 # Search class: HUUNF-FFSS00-SSSFFFNN
% 0.11/0.35 # partial match(1): HUUNF-FFSF00-SSSFFFNN
% 0.11/0.35 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.35 # Starting new_ho_10 with 811s (1) cores
% 0.11/0.35 # Starting post_as_ho5 with 151s (1) cores
% 0.11/0.35 # Starting new_bool_1 with 136s (1) cores
% 0.11/0.35 # Starting new_bool_2 with 136s (1) cores
% 0.11/0.35 # Starting new_bool_9 with 136s (1) cores
% 0.11/0.35 # new_ho_10 with pid 14759 completed with status 9
% 0.11/0.35 # Starting sh5l with 130s (1) cores
% 0.11/0.35 # post_as_ho5 with pid 14761 completed with status 0
% 0.11/0.35 # Result found by post_as_ho5
% 0.11/0.35 # Preprocessing class: HSSSSMSSSSMCSSN.
% 0.11/0.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.35 # Starting post_as_ho5 with 1500s (5) cores
% 0.11/0.35 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.11/0.35 # Search class: HUUNF-FFSS00-SSSFFFNN
% 0.11/0.35 # partial match(1): HUUNF-FFSF00-SSSFFFNN
% 0.11/0.35 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.35 # Starting new_ho_10 with 811s (1) cores
% 0.11/0.35 # Starting post_as_ho5 with 151s (1) cores
% 0.11/0.35 # Preprocessing time : 0.001 s
% 0.11/0.35 # Presaturation interreduction done
% 0.11/0.35
% 0.11/0.35 # Proof found!
% 0.11/0.35 # SZS status Theorem
% 0.11/0.35 # SZS output start CNFRefutation
% See solution above
% 0.11/0.35 # Parsed axioms : 2
% 0.11/0.35 # Removed by relevancy pruning/SinE : 1
% 0.11/0.35 # Initial clauses : 5
% 0.11/0.35 # Removed in clause preprocessing : 0
% 0.11/0.35 # Initial clauses in saturation : 5
% 0.11/0.35 # Processed clauses : 35
% 0.11/0.35 # ...of these trivial : 0
% 0.11/0.35 # ...subsumed : 3
% 0.11/0.35 # ...remaining for further processing : 32
% 0.11/0.35 # Other redundant clauses eliminated : 0
% 0.11/0.35 # Clauses deleted for lack of memory : 0
% 0.11/0.35 # Backward-subsumed : 6
% 0.11/0.35 # Backward-rewritten : 3
% 0.11/0.35 # Generated clauses : 33
% 0.11/0.35 # ...of the previous two non-redundant : 26
% 0.11/0.35 # ...aggressively subsumed : 0
% 0.11/0.35 # Contextual simplify-reflections : 2
% 0.11/0.35 # Paramodulations : 3
% 0.11/0.35 # Factorizations : 0
% 0.11/0.35 # NegExts : 4
% 0.11/0.35 # Equation resolutions : 0
% 0.11/0.35 # Disequality decompositions : 0
% 0.11/0.35 # Total rewrite steps : 4
% 0.11/0.35 # ...of those cached : 1
% 0.11/0.35 # Propositional unsat checks : 0
% 0.11/0.35 # Propositional check models : 0
% 0.11/0.35 # Propositional check unsatisfiable : 0
% 0.11/0.35 # Propositional clauses : 0
% 0.11/0.35 # Propositional clauses after purity: 0
% 0.11/0.35 # Propositional unsat core size : 0
% 0.11/0.35 # Propositional preprocessing time : 0.000
% 0.11/0.35 # Propositional encoding time : 0.000
% 0.11/0.35 # Propositional solver time : 0.000
% 0.11/0.35 # Success case prop preproc time : 0.000
% 0.11/0.35 # Success case prop encoding time : 0.000
% 0.11/0.35 # Success case prop solver time : 0.000
% 0.11/0.35 # Current number of processed clauses : 15
% 0.11/0.35 # Positive orientable unit clauses : 7
% 0.11/0.35 # Positive unorientable unit clauses: 0
% 0.11/0.35 # Negative unit clauses : 8
% 0.11/0.35 # Non-unit-clauses : 0
% 0.11/0.35 # Current number of unprocessed clauses: 0
% 0.11/0.35 # ...number of literals in the above : 0
% 0.11/0.35 # Current number of archived formulas : 0
% 0.11/0.35 # Current number of archived clauses : 17
% 0.11/0.35 # Clause-clause subsumption calls (NU) : 24
% 0.11/0.35 # Rec. Clause-clause subsumption calls : 24
% 0.11/0.35 # Non-unit clause-clause subsumptions : 3
% 0.11/0.35 # Unit Clause-clause subsumption calls : 35
% 0.11/0.35 # Rewrite failures with RHS unbound : 0
% 0.11/0.35 # BW rewrite match attempts : 9
% 0.11/0.35 # BW rewrite match successes : 3
% 0.11/0.35 # Condensation attempts : 0
% 0.11/0.35 # Condensation successes : 0
% 0.11/0.35 # Termbank termtop insertions : 952
% 0.11/0.35 # Search garbage collected termcells : 80
% 0.11/0.35
% 0.11/0.35 # -------------------------------------------------
% 0.11/0.35 # User time : 0.002 s
% 0.11/0.35 # System time : 0.003 s
% 0.11/0.35 # Total time : 0.005 s
% 0.11/0.35 # Maximum resident set size: 1812 pages
% 0.11/0.35
% 0.11/0.35 # -------------------------------------------------
% 0.11/0.35 # User time : 0.006 s
% 0.11/0.35 # System time : 0.008 s
% 0.11/0.35 # Total time : 0.014 s
% 0.11/0.35 # Maximum resident set size: 1708 pages
% 0.11/0.35 % E---3.1 exiting
% 0.11/0.35 % E exiting
%------------------------------------------------------------------------------