TSTP Solution File: SEV406^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV406^5 : TPTP v8.2.0. Released v4.0.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 04:08:20 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 15 ( 4 unt; 4 typ; 0 def)
% Number of atoms : 38 ( 1 equ; 0 cnn)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 59 ( 6 ~; 13 |; 1 &; 36 @)
% ( 0 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 10 ( 10 ^ 0 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
cA: $i > $o ).
thf(decl_23,type,
cB: $i > $o ).
thf(decl_24,type,
cP: ( $i > $o ) > $o ).
thf(decl_25,type,
esk1_0: $i ).
thf(cTRIVEXT2_pme,conjecture,
( ( cP
@ ^ [X1: $i] :
( ( cA @ X1 )
| ( cB @ X1 ) ) )
=> ( cP
@ ^ [X1: $i] :
( ( cB @ X1 )
| ( cA @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTRIVEXT2_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ( cP
@ ^ [Z0: $i] :
( ( cA @ Z0 )
| ( cB @ Z0 ) ) )
=> ( cP
@ ^ [Z0: $i] :
( ( cB @ Z0 )
| ( cA @ Z0 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTRIVEXT2_pme])]) ).
thf(c_0_2,negated_conjecture,
( ( cP
@ ^ [Z0: $i] :
( ( cA @ Z0 )
| ( cB @ Z0 ) ) )
& ~ ( cP
@ ^ [Z0: $i] :
( ( cB @ Z0 )
| ( cA @ Z0 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])]) ).
thf(c_0_3,negated_conjecture,
~ ( cP
@ ^ [Z0: $i] :
( ( cB @ Z0 )
| ( cA @ Z0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( cP
@ ^ [Z0: $i] :
( ( cA @ Z0 )
| ( cB @ Z0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,plain,
( ( ^ [Z0: $i] :
( ( cA @ Z0 )
| ( cB @ Z0 ) ) )
!= ( ^ [Z0: $i] :
( ( cB @ Z0 )
| ( cA @ Z0 ) ) ) ),
inference(ext_sup,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_6,plain,
( ( ( cA @ esk1_0 )
| ( cB @ esk1_0 ) )
<~> ( ( cB @ esk1_0 )
| ( cA @ esk1_0 ) ) ),
inference(neg_ext,[status(thm)],[c_0_5]) ).
thf(c_0_7,plain,
( ( cB @ esk1_0 )
| ( cA @ esk1_0 ) ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_6])]) ).
thf(c_0_8,plain,
~ ( cB @ esk1_0 ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_6])]) ).
thf(c_0_9,plain,
~ ( cA @ esk1_0 ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_6])]) ).
thf(c_0_10,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_7,c_0_8]),c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEV406^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n006.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun May 19 18:28:53 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/0.47 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: HSSSSMSSSSMNSSN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting sh3 with 1500s (5) cores
% 0.20/0.49 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.20/0.49 # Starting sh2lt with 300s (1) cores
% 0.20/0.49 # Starting ho_unfolding_1 with 300s (1) cores
% 0.20/0.49 # ehoh_best8_lambda with pid 27527 completed with status 0
% 0.20/0.49 # Result found by ehoh_best8_lambda
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSMNSSN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting sh3 with 1500s (5) cores
% 0.20/0.49 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HUUNF-FFSF00-MSSFFFNN
% 0.20/0.49 # partial match(1): HUUNF-FFSF00-SSSFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.49 # new_ho_10 with pid 27531 completed with status 9
% 0.20/0.49 # Starting ehoh_best8_lambda with 31s (1) cores
% 0.20/0.49 # ehoh_best8_lambda with pid 27538 completed with status 0
% 0.20/0.49 # Result found by ehoh_best8_lambda
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSMNSSN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting sh3 with 1500s (5) cores
% 0.20/0.49 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HUUNF-FFSF00-MSSFFFNN
% 0.20/0.49 # partial match(1): HUUNF-FFSF00-SSSFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.49 # new_ho_10 with pid 27531 completed with status 9
% 0.20/0.49 # Starting ehoh_best8_lambda with 31s (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 : 4
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 5
% 0.20/0.49 # Removed in clause preprocessing : 3
% 0.20/0.49 # Initial clauses in saturation : 2
% 0.20/0.49 # Processed clauses : 12
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 2
% 0.20/0.49 # ...remaining for further processing : 9
% 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 : 0
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 9
% 0.20/0.49 # ...of the previous two non-redundant : 9
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 0
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 1
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 0
% 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 : 5
% 0.20/0.49 # Positive orientable unit clauses : 1
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 4
% 0.20/0.49 # Non-unit-clauses : 0
% 0.20/0.49 # Current number of unprocessed clauses: 1
% 0.20/0.49 # ...number of literals in the above : 1
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 4
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.49 # Non-unit clause-clause subsumptions : 0
% 0.20/0.49 # Unit Clause-clause subsumption calls : 2
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 0
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 427
% 0.20/0.49 # Search garbage collected termcells : 13
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.005 s
% 0.20/0.49 # System time : 0.002 s
% 0.20/0.49 # Total time : 0.007 s
% 0.20/0.49 # Maximum resident set size: 1624 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.005 s
% 0.20/0.49 # System time : 0.005 s
% 0.20/0.49 # Total time : 0.010 s
% 0.20/0.49 # Maximum resident set size: 1700 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------