TSTP Solution File: SYO526^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO526^1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:47:57 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 29 ( 14 unt; 5 typ; 0 def)
% Number of atoms : 56 ( 10 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 32 ( 13 ~; 8 |; 1 &; 7 @)
% ( 2 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 11 ( 8 ^ 3 !; 0 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
a: $o ).
thf(decl_23,type,
b: $o ).
thf(decl_24,type,
f: $i > $o ).
thf(decl_25,type,
g: $i > $o ).
thf(decl_26,type,
esk1_0: $i ).
thf(gb,conjecture,
( g
= ( ^ [X1: $i] : b ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gb) ).
thf(fg,axiom,
f = g,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fg) ).
thf(fa,axiom,
( f
= ( ^ [X1: $i] : a ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fa) ).
thf(ab,axiom,
( a
<=> b ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ab) ).
thf(c_0_4,negated_conjecture,
( g
!= ( ^ [Z0: $i] : b ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[gb])])]) ).
thf(c_0_5,negated_conjecture,
( g
!= ( ^ [Z0: $i] : b ) ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
( g
!= ( ^ [Z0: $i] : b ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_7,plain,
f = g,
inference(split_conjunct,[status(thm)],[fg]) ).
thf(c_0_8,plain,
( f
= ( ^ [Z0: $i] : a ) ),
inference(fof_simplification,[status(thm)],[fa]) ).
thf(c_0_9,negated_conjecture,
( ( ^ [Z0: $i] : b )
!= f ),
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_10,plain,
( f
= ( ^ [Z0: $i] : a ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_11,negated_conjecture,
( ( f @ esk1_0 )
<~> b ),
inference(neg_ext,[status(thm)],[c_0_9]) ).
thf(c_0_12,plain,
! [X3: $i] :
( ( f @ X3 )
<=> a ),
inference(arg_cong,[status(thm)],[c_0_10]) ).
thf(c_0_13,plain,
( ( ~ a
| b )
& ( ~ b
| a ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ab])]) ).
thf(c_0_14,negated_conjecture,
( ~ ( f @ esk1_0 )
| ~ b ),
inference(dynamic_cnf,[status(thm)],[c_0_11]) ).
thf(c_0_15,plain,
! [X1: $i] :
( ( f @ X1 )
| ~ a ),
inference(dynamic_cnf,[status(thm)],[c_0_12]) ).
thf(c_0_16,plain,
( a
| ~ b ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_17,negated_conjecture,
( ( f @ esk1_0 )
| b ),
inference(dynamic_cnf,[status(thm)],[c_0_11]) ).
thf(c_0_18,negated_conjecture,
~ b,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
thf(c_0_19,plain,
! [X1: $i] :
( a
| ~ ( f @ X1 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_12]) ).
thf(c_0_20,negated_conjecture,
f @ esk1_0,
inference(sr,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_21,plain,
( b
| ~ a ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_22,negated_conjecture,
a,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_23,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO526^1 : TPTP v8.2.0. Released v5.2.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n019.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 10:02:53 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.50 # Version: 3.1.0-ho
% 0.20/0.50 # partial match(1): HSSSSMSSSSSNSSN
% 0.20/0.50 # Preprocessing class: HSSSSLSSSSSNSSN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.20/0.50 # Starting post_as_ho10 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # new_bool_9 with pid 2446 completed with status 0
% 0.20/0.50 # Result found by new_bool_9
% 0.20/0.50 # partial match(1): HSSSSMSSSSSNSSN
% 0.20/0.50 # Preprocessing class: HSSSSLSSSSSNSSN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.20/0.50 # Starting post_as_ho10 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.20/0.50 # Search class: HHUSF-FFSF00-SSSFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting new_ho_10 with 181s (1) cores
% 0.20/0.50 # new_ho_10 with pid 2450 completed with status 0
% 0.20/0.50 # Result found by new_ho_10
% 0.20/0.50 # partial match(1): HSSSSMSSSSSNSSN
% 0.20/0.50 # Preprocessing class: HSSSSLSSSSSNSSN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.20/0.50 # Starting post_as_ho10 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.20/0.50 # Search class: HHUSF-FFSF00-SSSFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting new_ho_10 with 181s (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 : 8
% 0.20/0.50 # Removed by relevancy pruning/SinE : 4
% 0.20/0.50 # Initial clauses : 5
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 5
% 0.20/0.50 # Processed clauses : 22
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 0
% 0.20/0.50 # ...remaining for further processing : 22
% 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 : 2
% 0.20/0.50 # Backward-rewritten : 3
% 0.20/0.50 # Generated clauses : 18
% 0.20/0.50 # ...of the previous two non-redundant : 15
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 1
% 0.20/0.50 # Paramodulations : 8
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 1
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 4
% 0.20/0.50 # ...of those cached : 2
% 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 : 8
% 0.20/0.50 # Positive orientable unit clauses : 4
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 2
% 0.20/0.50 # Non-unit-clauses : 2
% 0.20/0.50 # Current number of unprocessed clauses: 2
% 0.20/0.50 # ...number of literals in the above : 3
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 14
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 5
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 1
% 0.20/0.50 # Non-unit clause-clause subsumptions : 1
% 0.20/0.50 # Unit Clause-clause subsumption calls : 2
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 3
% 0.20/0.50 # BW rewrite match successes : 1
% 0.20/0.50 # Condensation attempts : 22
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 473
% 0.20/0.50 # Search garbage collected termcells : 14
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.004 s
% 0.20/0.50 # System time : 0.002 s
% 0.20/0.50 # Total time : 0.006 s
% 0.20/0.50 # Maximum resident set size: 1640 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.004 s
% 0.20/0.50 # System time : 0.005 s
% 0.20/0.50 # Total time : 0.009 s
% 0.20/0.50 # Maximum resident set size: 1704 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------