TSTP Solution File: SEV406^5 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SEV406^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:26 EDT 2024
% Result : Theorem 0.10s 0.34s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 80 ( 3 equ; 0 cnn)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 128 ( 22 ~; 28 |; 5 &; 68 @)
% ( 2 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 18 ( 6 ^ 12 !; 0 ?; 18 :)
% 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,
epred1_0: $i > $o ).
thf(decl_26,type,
epred2_0: $i > $o ).
thf(decl_27,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/sandbox2/tmp/tmp.yVwvMbvGAw/E---3.1_15167.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,plain,
! [X2: $i] :
( ( epred1_0 @ X2 )
<=> ( ( cB @ X2 )
| ( cA @ X2 ) ) ),
introduced(definition) ).
thf(c_0_4,plain,
! [X3: $i] :
( ( epred2_0 @ X3 )
<=> ( ( cA @ X3 )
| ( cB @ X3 ) ) ),
introduced(definition) ).
thf(c_0_5,negated_conjecture,
( ( cP @ epred1_0 )
!= $true ),
inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]),c_0_3]) ).
thf(c_0_6,negated_conjecture,
( ( cP @ epred2_0 )
= $true ),
inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]),c_0_4]) ).
thf(c_0_7,negated_conjecture,
~ ( cP @ epred1_0 ),
inference(cn,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
cP @ epred2_0,
inference(cn,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
epred2_0 != epred1_0,
inference(ext_sup,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_10,plain,
! [X4: $i] :
( ( ~ ( epred2_0 @ X4 )
| ( cA @ X4 )
| ( cB @ X4 ) )
& ( ~ ( cA @ X4 )
| ( epred2_0 @ X4 ) )
& ( ~ ( cB @ X4 )
| ( epred2_0 @ X4 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])]) ).
thf(c_0_11,plain,
! [X5: $i] :
( ( ~ ( epred1_0 @ X5 )
| ( cB @ X5 )
| ( cA @ X5 ) )
& ( ~ ( cB @ X5 )
| ( epred1_0 @ X5 ) )
& ( ~ ( cA @ X5 )
| ( epred1_0 @ X5 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])]) ).
thf(c_0_12,plain,
( ( epred2_0 @ esk1_0 )
<~> ( epred1_0 @ esk1_0 ) ),
inference(neg_ext,[status(thm)],[c_0_9]) ).
thf(c_0_13,plain,
! [X1: $i] :
( ( epred2_0 @ X1 )
| ~ ( cB @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_14,plain,
! [X1: $i] :
( ( cB @ X1 )
| ( cA @ X1 )
| ~ ( epred1_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_15,plain,
! [X1: $i] :
( ( epred2_0 @ X1 )
| ~ ( cA @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_16,plain,
( ~ ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_12]) ).
thf(c_0_17,plain,
! [X1: $i] :
( ( epred2_0 @ X1 )
| ~ ( epred1_0 @ X1 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
thf(c_0_18,plain,
! [X1: $i] :
( ( epred1_0 @ X1 )
| ~ ( cB @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_19,plain,
! [X1: $i] :
( ( cA @ X1 )
| ( cB @ X1 )
| ~ ( epred2_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_20,plain,
! [X1: $i] :
( ( epred1_0 @ X1 )
| ~ ( cA @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_21,plain,
( ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_12]) ).
thf(c_0_22,plain,
~ ( epred1_0 @ esk1_0 ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_23,plain,
! [X1: $i] :
( ( epred1_0 @ X1 )
| ~ ( epred2_0 @ X1 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
thf(c_0_24,plain,
epred2_0 @ esk1_0,
inference(sr,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_25,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : SEV406^5 : TPTP v8.2.0. Released v4.0.0.
% 0.00/0.06 % Command : run_E %s %d THM
% 0.06/0.24 % Computer : n028.cluster.edu
% 0.06/0.24 % Model : x86_64 x86_64
% 0.06/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.24 % Memory : 8042.1875MB
% 0.06/0.24 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.24 % CPULimit : 300
% 0.06/0.24 % WCLimit : 300
% 0.06/0.24 % DateTime : Fri Jun 21 18:26:23 EDT 2024
% 0.06/0.24 % CPUTime :
% 0.10/0.33 Running higher-order theorem proving
% 0.10/0.33 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/tmp/tmp.yVwvMbvGAw/E---3.1_15167.p
% 0.10/0.34 # Version: 3.2.0-ho
% 0.10/0.34 # Preprocessing class: HSSSSMSSSSMNSSN.
% 0.10/0.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.34 # Starting sh3 with 1500s (5) cores
% 0.10/0.34 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.10/0.34 # Starting sh2lt with 300s (1) cores
% 0.10/0.34 # Starting ho_unfolding_1 with 300s (1) cores
% 0.10/0.34 # sh2lt with pid 15284 completed with status 0
% 0.10/0.34 # Result found by sh2lt
% 0.10/0.34 # Preprocessing class: HSSSSMSSSSMNSSN.
% 0.10/0.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.34 # Starting sh3 with 1500s (5) cores
% 0.10/0.34 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.10/0.34 # Starting sh2lt with 300s (1) cores
% 0.10/0.34 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.10/0.34 # Search class: HGUNF-FFSF00-SSSFFFNN
% 0.10/0.34 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.34 # Starting sh3 with 163s (1) cores
% 0.10/0.34 # sh3 with pid 15289 completed with status 0
% 0.10/0.34 # Result found by sh3
% 0.10/0.34 # Preprocessing class: HSSSSMSSSSMNSSN.
% 0.10/0.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.34 # Starting sh3 with 1500s (5) cores
% 0.10/0.34 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.10/0.34 # Starting sh2lt with 300s (1) cores
% 0.10/0.34 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.10/0.34 # Search class: HGUNF-FFSF00-SSSFFFNN
% 0.10/0.34 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.34 # Starting sh3 with 163s (1) cores
% 0.10/0.34 # Preprocessing time : 0.001 s
% 0.10/0.34 # Presaturation interreduction done
% 0.10/0.34
% 0.10/0.34 # Proof found!
% 0.10/0.34 # SZS status Theorem
% 0.10/0.34 # SZS output start CNFRefutation
% See solution above
% 0.10/0.34 # Parsed axioms : 4
% 0.10/0.34 # Removed by relevancy pruning/SinE : 3
% 0.10/0.34 # Initial clauses : 8
% 0.10/0.34 # Removed in clause preprocessing : 0
% 0.10/0.34 # Initial clauses in saturation : 8
% 0.10/0.34 # Processed clauses : 24
% 0.10/0.34 # ...of these trivial : 0
% 0.10/0.34 # ...subsumed : 0
% 0.10/0.34 # ...remaining for further processing : 24
% 0.10/0.34 # Other redundant clauses eliminated : 0
% 0.10/0.34 # Clauses deleted for lack of memory : 0
% 0.10/0.34 # Backward-subsumed : 1
% 0.10/0.34 # Backward-rewritten : 0
% 0.10/0.34 # Generated clauses : 13
% 0.10/0.34 # ...of the previous two non-redundant : 8
% 0.10/0.34 # ...aggressively subsumed : 0
% 0.10/0.34 # Contextual simplify-reflections : 2
% 0.10/0.34 # Paramodulations : 8
% 0.10/0.34 # Factorizations : 0
% 0.10/0.34 # NegExts : 1
% 0.10/0.34 # Equation resolutions : 0
% 0.10/0.34 # Disequality decompositions : 0
% 0.10/0.34 # Total rewrite steps : 0
% 0.10/0.34 # ...of those cached : 0
% 0.10/0.34 # Propositional unsat checks : 0
% 0.10/0.34 # Propositional check models : 0
% 0.10/0.34 # Propositional check unsatisfiable : 0
% 0.10/0.34 # Propositional clauses : 0
% 0.10/0.34 # Propositional clauses after purity: 0
% 0.10/0.34 # Propositional unsat core size : 0
% 0.10/0.34 # Propositional preprocessing time : 0.000
% 0.10/0.34 # Propositional encoding time : 0.000
% 0.10/0.34 # Propositional solver time : 0.000
% 0.10/0.34 # Success case prop preproc time : 0.000
% 0.10/0.34 # Success case prop encoding time : 0.000
% 0.10/0.34 # Success case prop solver time : 0.000
% 0.10/0.34 # Current number of processed clauses : 13
% 0.10/0.34 # Positive orientable unit clauses : 2
% 0.10/0.34 # Positive unorientable unit clauses: 0
% 0.10/0.34 # Negative unit clauses : 3
% 0.10/0.34 # Non-unit-clauses : 8
% 0.10/0.34 # Current number of unprocessed clauses: 0
% 0.10/0.34 # ...number of literals in the above : 0
% 0.10/0.34 # Current number of archived formulas : 0
% 0.10/0.34 # Current number of archived clauses : 11
% 0.10/0.34 # Clause-clause subsumption calls (NU) : 4
% 0.10/0.34 # Rec. Clause-clause subsumption calls : 2
% 0.10/0.34 # Non-unit clause-clause subsumptions : 2
% 0.10/0.34 # Unit Clause-clause subsumption calls : 7
% 0.10/0.34 # Rewrite failures with RHS unbound : 0
% 0.10/0.34 # BW rewrite match attempts : 0
% 0.10/0.34 # BW rewrite match successes : 0
% 0.10/0.34 # Condensation attempts : 0
% 0.10/0.34 # Condensation successes : 0
% 0.10/0.34 # Termbank termtop insertions : 708
% 0.10/0.34 # Search garbage collected termcells : 82
% 0.10/0.34
% 0.10/0.34 # -------------------------------------------------
% 0.10/0.34 # User time : 0.002 s
% 0.10/0.34 # System time : 0.001 s
% 0.10/0.34 # Total time : 0.003 s
% 0.10/0.34 # Maximum resident set size: 1800 pages
% 0.10/0.34
% 0.10/0.34 # -------------------------------------------------
% 0.10/0.34 # User time : 0.002 s
% 0.10/0.34 # System time : 0.003 s
% 0.10/0.34 # Total time : 0.005 s
% 0.10/0.34 # Maximum resident set size: 1704 pages
% 0.10/0.34 % E---3.1 exiting
% 0.10/0.34 % E exiting
%------------------------------------------------------------------------------