TSTP Solution File: SEV396^5 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SEV396^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : Mon Jun 24 15:54:24 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 18 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 72 ( 8 equ; 0 cnn)
% Maximal formula atoms : 7 ( 4 avg)
% Number of connectives : 111 ( 18 ~; 18 |; 13 &; 55 @)
% ( 3 <=>; 2 =>; 0 <=; 2 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 15 ( 8 ^ 7 !; 0 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
cR: $i > $o ).
thf(decl_23,type,
cS: $i > $o ).
thf(decl_24,type,
esk1_0: $i ).
thf(decl_25,type,
esk2_0: $i ).
thf(decl_26,type,
esk3_0: $i ).
thf(cTHM31_pme,conjecture,
( ! [X1: $i] :
( ( cR @ X1 )
=> ( cS @ X1 ) )
<=> ( ( ^ [X1: $i] :
( ( cR @ X1 )
& ( cS @ X1 ) ) )
= cR ) ),
file('/export/starexec/sandbox/tmp/tmp.dddfZnd76E/E---3.1_18264.p',cTHM31_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ! [X1: $i] :
( ( cR @ X1 )
=> ( cS @ X1 ) )
<=> ( ( ^ [Z0: $i] :
( ( cR @ Z0 )
& ( cS @ Z0 ) ) )
= cR ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM31_pme])]) ).
thf(c_0_2,negated_conjecture,
! [X4: $i] :
( ( ( cR @ esk1_0 )
| ( ( ^ [Z0: $i] :
( ( cR @ Z0 )
& ( cS @ Z0 ) ) )
!= cR ) )
& ( ~ ( cS @ esk1_0 )
| ( ( ^ [Z0: $i] :
( ( cR @ Z0 )
& ( cS @ Z0 ) ) )
!= cR ) )
& ( ~ ( cR @ X4 )
| ( cS @ X4 )
| ( ( ^ [Z0: $i] :
( ( cR @ Z0 )
& ( cS @ Z0 ) ) )
= cR ) ) ),
inference(distribute,[status(thm)],[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,
( ~ ( cS @ esk1_0 )
| ( ( ^ [Z0: $i] :
( ( cR @ Z0 )
& ( cS @ Z0 ) ) )
!= cR ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( ( cR @ esk1_0 )
| ( ( ^ [Z0: $i] :
( ( cR @ Z0 )
& ( cS @ Z0 ) ) )
!= cR ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X1: $i] :
( ( cS @ X1 )
| ( ( ^ [Z0: $i] :
( ( cR @ Z0 )
& ( cS @ Z0 ) ) )
= cR )
| ~ ( cR @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
( ( ( ( cR @ esk2_0 )
& ( cS @ esk2_0 ) )
<~> ( cR @ esk2_0 ) )
| ~ ( cS @ esk1_0 ) ),
inference(neg_ext,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
( ( cR @ esk1_0 )
| ( ( ( cR @ esk3_0 )
& ( cS @ esk3_0 ) )
<~> ( cR @ esk3_0 ) ) ),
inference(neg_ext,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X5: $i,X1: $i] :
( ( ( ( cR @ X5 )
& ( cS @ X5 ) )
<=> ( cR @ X5 ) )
| ( cS @ X1 )
| ~ ( cR @ X1 ) ),
inference(arg_cong,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
( ( cR @ esk2_0 )
| ~ ( cS @ esk1_0 ) ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_6])]) ).
thf(c_0_10,negated_conjecture,
( ( cR @ esk1_0 )
| ~ ( cR @ esk3_0 )
| ~ ( cS @ esk3_0 ) ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_7])]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i] :
( ( cS @ X1 )
| ~ ( cR @ X1 ) ),
inference(condense,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_8])]) ).
thf(c_0_12,negated_conjecture,
( ( cR @ esk1_0 )
| ( cR @ esk3_0 ) ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_7])]) ).
thf(c_0_13,negated_conjecture,
( ~ ( cS @ esk2_0 )
| ~ ( cS @ esk1_0 ) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_6])]),c_0_9]) ).
thf(c_0_14,negated_conjecture,
cR @ esk1_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
thf(c_0_15,negated_conjecture,
~ ( cS @ esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_11]),c_0_14])]) ).
thf(c_0_16,negated_conjecture,
cR @ esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_11]),c_0_14])]) ).
thf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_11]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEV396^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Jun 21 18:37:09 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.20/0.49 Running higher-order theorem proving
% 0.20/0.49 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/tmp/tmp.dddfZnd76E/E---3.1_18264.p
% 0.20/0.50 # Version: 3.2.0-ho
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNSSN.
% 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 18345 completed with status 0
% 0.20/0.50 # Result found by new_bool_9
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNSSN.
% 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: HGHSF-FFSF00-MSSFFFNN
% 0.20/0.50 # partial match(1): HGHSF-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 18347 completed with status 0
% 0.20/0.50 # Result found by new_ho_10
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNSSN.
% 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: HGHSF-FFSF00-MSSFFFNN
% 0.20/0.50 # partial match(1): HGHSF-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 : 3
% 0.20/0.50 # Removed by relevancy pruning/SinE : 2
% 0.20/0.50 # Initial clauses : 3
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 3
% 0.20/0.50 # Processed clauses : 20
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 2
% 0.20/0.50 # ...remaining for further processing : 17
% 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 : 3
% 0.20/0.50 # Backward-rewritten : 3
% 0.20/0.50 # Generated clauses : 17
% 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 : 2
% 0.20/0.50 # Paramodulations : 5
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 2
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 6
% 0.20/0.50 # ...of those cached : 4
% 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 : 5
% 0.20/0.50 # Positive orientable unit clauses : 2
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 1
% 0.20/0.50 # Non-unit-clauses : 2
% 0.20/0.50 # Current number of unprocessed clauses: 0
% 0.20/0.50 # ...number of literals in the above : 0
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 12
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 6
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 6
% 0.20/0.50 # Non-unit clause-clause subsumptions : 6
% 0.20/0.50 # Unit Clause-clause subsumption calls : 3
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 2
% 0.20/0.50 # BW rewrite match successes : 2
% 0.20/0.50 # Condensation attempts : 20
% 0.20/0.50 # Condensation successes : 1
% 0.20/0.50 # Termbank termtop insertions : 966
% 0.20/0.50 # Search garbage collected termcells : 75
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.003 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.005 s
% 0.20/0.50 # Maximum resident set size: 1812 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.003 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: 1700 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------