TSTP Solution File: SEV427^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV427^1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:22 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 17 ( 3 unt; 3 typ; 0 def)
% Number of atoms : 25 ( 0 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 50 ( 8 ~; 7 |; 1 &; 33 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 11 ( 0 ^ 10 !; 1 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
eps: ( $i > $o ) > $i ).
thf(decl_23,type,
p: $i > $o ).
thf(decl_24,type,
q: $i > $o ).
thf(conj,conjecture,
( ( p @ ( eps @ p ) )
| ( q @ ( eps @ q ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(choiceax,axiom,
! [X1: $i > $o] :
( ? [X2: $i] : ( X1 @ X2 )
=> ( X1 @ ( eps @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',choiceax) ).
thf(pq,axiom,
! [X2: $i] :
( ( p @ X2 )
| ( q @ X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pq) ).
thf(c_0_3,negated_conjecture,
~ ( ( p @ ( eps @ p ) )
| ( q @ ( eps @ q ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
thf(c_0_4,negated_conjecture,
( ~ ( p @ ( eps @ p ) )
& ~ ( q @ ( eps @ q ) ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
thf(c_0_5,plain,
! [X7: $i > $o,X8: $i] :
( ~ ( X7 @ X8 )
| ( X7 @ ( eps @ X7 ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[choiceax])])])]) ).
thf(c_0_6,plain,
! [X6: $i] :
( ( p @ X6 )
| ( q @ X6 ) ),
inference(variable_rename,[status(thm)],[pq]) ).
thf(c_0_7,negated_conjecture,
~ ( p @ ( eps @ p ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,plain,
! [X1: $i > $o,X2: $i] :
( ( X1 @ ( eps @ X1 ) )
| ~ ( X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,plain,
! [X2: $i] :
( ( p @ X2 )
| ( q @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
! [X2: $i] :
~ ( p @ X2 ),
inference(sr,[status(thm)],[inference(choice_inst,[status(thm)],[c_0_7,c_0_8]),c_0_7]) ).
thf(c_0_11,negated_conjecture,
~ ( q @ ( eps @ q ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_12,plain,
! [X2: $i] : ( q @ X2 ),
inference(sr,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEV427^1 : TPTP v8.2.0. Released v5.2.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n005.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 19:08:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 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.49 # Version: 3.1.0-ho
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSCSSA.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_9 with 300s (1) cores
% 0.20/0.49 # Starting full_lambda_8 with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho10 with 300s (1) cores
% 0.20/0.49 # new_bool_9 with pid 925 completed with status 0
% 0.20/0.49 # Result found by new_bool_9
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSCSSA.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_9 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.20/0.49 # Search class: HGUNF-FFSF11-SSSFFSBC
% 0.20/0.49 # partial match(1): HGUNF-FFSF11-SSSFFSBN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 100s (1) cores
% 0.20/0.49 # new_ho_10 with pid 928 completed with status 0
% 0.20/0.49 # Result found by new_ho_10
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSCSSA.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_9 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.20/0.49 # Search class: HGUNF-FFSF11-SSSFFSBC
% 0.20/0.49 # partial match(1): HGUNF-FFSF11-SSSFFSBN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 100s (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 : 6
% 0.20/0.49 # Removed by relevancy pruning/SinE : 3
% 0.20/0.49 # Initial clauses : 4
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 4
% 0.20/0.49 # Processed clauses : 10
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 10
% 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 : 1
% 0.20/0.49 # Generated clauses : 8
% 0.20/0.49 # ...of the previous two non-redundant : 7
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 3
% 0.20/0.49 # Factorizations : 0
% 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 : 1
% 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 : 3
% 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 : 1
% 0.20/0.49 # Non-unit-clauses : 1
% 0.20/0.49 # Current number of unprocessed clauses: 3
% 0.20/0.49 # ...number of literals in the above : 5
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 7
% 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 : 1
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 1
% 0.20/0.49 # BW rewrite match successes : 1
% 0.20/0.49 # Condensation attempts : 10
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 324
% 0.20/0.49 # Search garbage collected termcells : 39
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.004 s
% 0.20/0.49 # System time : 0.001 s
% 0.20/0.49 # Total time : 0.005 s
% 0.20/0.49 # Maximum resident set size: 1796 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.006 s
% 0.20/0.49 # System time : 0.001 s
% 0.20/0.49 # Total time : 0.008 s
% 0.20/0.49 # Maximum resident set size: 1704 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------