TSTP Solution File: SYO376^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO376^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:45:47 EDT 2024
% Result : Theorem 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 7 unt; 6 typ; 0 def)
% Number of atoms : 102 ( 3 equ; 0 cnn)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 113 ( 26 ~; 21 |; 5 &; 53 @)
% ( 0 <=>; 2 =>; 0 <=; 6 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 11 ( 11 ^ 0 !; 0 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
cG: $o > $o ).
thf(decl_23,type,
cF: $o > $o ).
thf(decl_24,type,
cP: ( $o > $o ) > $o ).
thf(decl_25,type,
esk1_0: $o ).
thf(decl_26,type,
esk2_0: $o ).
thf(decl_27,type,
esk3_0: $o ).
thf(cTHM627,conjecture,
( ( ( cP @ cF )
& ( cP @ cG ) )
=> ( ( cP
@ ^ [X1: $o] :
( ( cF @ X1 )
| ( cG @ X1 ) ) )
| ( cP
@ ^ [X1: $o] :
( ~ ( cF @ X1 )
| ( cG @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM627) ).
thf(c_0_1,negated_conjecture,
~ ( ( ( cP @ cF )
& ( cP @ cG ) )
=> ( ( cP
@ ^ [Z0: $o] :
( ( cF @ Z0 )
| ( cG @ Z0 ) ) )
| ( cP
@ ^ [Z0: $o] :
( ~ ( cF @ Z0 )
| ( cG @ Z0 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM627])]) ).
thf(c_0_2,negated_conjecture,
( ( cP @ cF )
& ( cP @ cG )
& ~ ( cP
@ ^ [Z0: $o] :
( ( cF @ Z0 )
| ( cG @ Z0 ) ) )
& ~ ( cP
@ ^ [Z0: $o] :
( ~ ( cF @ Z0 )
| ( cG @ Z0 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])]) ).
thf(c_0_3,negated_conjecture,
~ ( cP
@ ^ [Z0: $o] :
( ~ ( cF @ Z0 )
| ( cG @ Z0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
cP @ cG,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
~ ( cP
@ ^ [Z0: $o] :
( ( cF @ Z0 )
| ( cG @ Z0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
cP @ cF,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,plain,
( ( ^ [Z0: $o] :
( ~ ( cF @ Z0 )
| ( cG @ Z0 ) ) )
!= cG ),
inference(ext_sup,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_8,plain,
( ( ^ [Z0: $o] :
( ( cF @ Z0 )
| ( cG @ Z0 ) ) )
!= cG ),
inference(ext_sup,[status(thm)],[c_0_5,c_0_4]) ).
thf(c_0_9,plain,
( ( ^ [Z0: $o] :
( ( cF @ Z0 )
| ( cG @ Z0 ) ) )
!= cF ),
inference(ext_sup,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_10,plain,
( ( ~ ( cF @ esk3_0 )
| ( cG @ esk3_0 ) )
<~> ( cG @ esk3_0 ) ),
inference(neg_ext,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
( ( ( cF @ esk1_0 )
| ( cG @ esk1_0 ) )
<~> ( cG @ esk1_0 ) ),
inference(neg_ext,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
( ( ( cF @ esk2_0 )
| ( cG @ esk2_0 ) )
<~> ( cF @ esk2_0 ) ),
inference(neg_ext,[status(thm)],[c_0_9]) ).
thf(c_0_13,plain,
~ ( cG @ esk3_0 ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_10])]) ).
thf(c_0_14,plain,
~ ( cG @ esk1_0 ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_11])]) ).
thf(c_0_15,plain,
~ ( cF @ esk2_0 ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_12])]) ).
thf(c_0_16,plain,
~ ( cF @ esk3_0 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_10])]),c_0_13]) ).
thf(c_0_17,plain,
cF @ esk1_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_11])]),c_0_14]) ).
thf(c_0_18,plain,
cG @ esk2_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_12])]),c_0_15]) ).
thf(c_0_19,plain,
( esk1_0
<~> esk3_0 ),
inference(ext_sup,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_20,plain,
( esk1_0
<~> esk2_0 ),
inference(ext_sup,[status(thm)],[c_0_15,c_0_17]) ).
thf(c_0_21,plain,
( esk2_0
<~> esk3_0 ),
inference(ext_sup,[status(thm)],[c_0_13,c_0_18]) ).
thf(c_0_22,plain,
( ~ esk1_0
| ~ esk3_0 ),
inference(dynamic_cnf,[status(thm)],[c_0_19]) ).
thf(c_0_23,plain,
( esk2_0
| esk1_0 ),
inference(dynamic_cnf,[status(thm)],[c_0_20]) ).
thf(c_0_24,plain,
( esk3_0
| esk2_0 ),
inference(dynamic_cnf,[status(thm)],[c_0_21]) ).
thf(c_0_25,plain,
( ~ esk1_0
| ~ esk2_0 ),
inference(dynamic_cnf,[status(thm)],[c_0_20]) ).
thf(c_0_26,plain,
esk2_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
thf(c_0_27,plain,
( ~ esk2_0
| ~ esk3_0 ),
inference(dynamic_cnf,[status(thm)],[c_0_21]) ).
thf(c_0_28,plain,
~ esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
thf(c_0_29,plain,
~ esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_26])]) ).
thf(c_0_30,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_19]),c_0_28]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO376^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n020.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 09:30:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/0.47 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.48 # Version: 3.1.0-ho
% 0.20/0.48 # Preprocessing class: HSSSSMSSSSMCSSN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting post_as_ho5 with 1500s (5) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # Starting post_as_ho10 with 300s (1) cores
% 0.20/0.48 # Starting post_as_ho4 with 300s (1) cores
% 0.20/0.48 # post_as_ho5 with pid 15890 completed with status 0
% 0.20/0.48 # Result found by post_as_ho5
% 0.20/0.48 # Preprocessing class: HSSSSMSSSSMCSSN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting post_as_ho5 with 1500s (5) cores
% 0.20/0.48 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.20/0.48 # Search class: HUUNF-FFSF00-MSSFFFNN
% 0.20/0.48 # partial match(1): HUUNF-FFSF00-SSSFFFNN
% 0.20/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.48 # Starting new_ho_10 with 811s (1) cores
% 0.20/0.48 # Starting post_as_ho5 with 151s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.48 # Starting new_bool_2 with 136s (1) cores
% 0.20/0.48 # Starting new_bool_9 with 136s (1) cores
% 0.20/0.48 # new_ho_10 with pid 15894 completed with status 9
% 0.20/0.48 # Starting sh5l with 130s (1) cores
% 0.20/0.48 # new_bool_2 with pid 15898 completed with status 0
% 0.20/0.48 # Result found by new_bool_2
% 0.20/0.48 # Preprocessing class: HSSSSMSSSSMCSSN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting post_as_ho5 with 1500s (5) cores
% 0.20/0.48 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.20/0.48 # Search class: HUUNF-FFSF00-MSSFFFNN
% 0.20/0.48 # partial match(1): HUUNF-FFSF00-SSSFFFNN
% 0.20/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.48 # Starting new_ho_10 with 811s (1) cores
% 0.20/0.48 # Starting post_as_ho5 with 151s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.48 # Starting new_bool_2 with 136s (1) cores
% 0.20/0.48 # Preprocessing time : 0.001 s
% 0.20/0.48 # Presaturation interreduction done
% 0.20/0.48
% 0.20/0.48 # Proof found!
% 0.20/0.48 # SZS status Theorem
% 0.20/0.48 # SZS output start CNFRefutation
% See solution above
% 0.20/0.48 # Parsed axioms : 4
% 0.20/0.48 # Removed by relevancy pruning/SinE : 3
% 0.20/0.48 # Initial clauses : 4
% 0.20/0.48 # Removed in clause preprocessing : 0
% 0.20/0.48 # Initial clauses in saturation : 4
% 0.20/0.48 # Processed clauses : 40
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 4
% 0.20/0.48 # ...remaining for further processing : 35
% 0.20/0.48 # Other redundant clauses eliminated : 0
% 0.20/0.48 # Clauses deleted for lack of memory : 0
% 0.20/0.48 # Backward-subsumed : 2
% 0.20/0.48 # Backward-rewritten : 5
% 0.20/0.48 # Generated clauses : 35
% 0.20/0.48 # ...of the previous two non-redundant : 37
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 1
% 0.20/0.48 # Paramodulations : 3
% 0.20/0.48 # Factorizations : 0
% 0.20/0.48 # NegExts : 4
% 0.20/0.48 # Equation resolutions : 0
% 0.20/0.48 # Disequality decompositions : 0
% 0.20/0.48 # Total rewrite steps : 6
% 0.20/0.48 # ...of those cached : 4
% 0.20/0.48 # Propositional unsat checks : 0
% 0.20/0.48 # Propositional check models : 0
% 0.20/0.48 # Propositional check unsatisfiable : 0
% 0.20/0.48 # Propositional clauses : 0
% 0.20/0.48 # Propositional clauses after purity: 0
% 0.20/0.48 # Propositional unsat core size : 0
% 0.20/0.48 # Propositional preprocessing time : 0.000
% 0.20/0.48 # Propositional encoding time : 0.000
% 0.20/0.48 # Propositional solver time : 0.000
% 0.20/0.48 # Success case prop preproc time : 0.000
% 0.20/0.48 # Success case prop encoding time : 0.000
% 0.20/0.48 # Success case prop solver time : 0.000
% 0.20/0.48 # Current number of processed clauses : 17
% 0.20/0.48 # Positive orientable unit clauses : 5
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 12
% 0.20/0.48 # Non-unit-clauses : 0
% 0.20/0.48 # Current number of unprocessed clauses: 5
% 0.20/0.48 # ...number of literals in the above : 6
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 18
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 8
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 8
% 0.20/0.48 # Non-unit clause-clause subsumptions : 3
% 0.20/0.48 # Unit Clause-clause subsumption calls : 23
% 0.20/0.48 # Rewrite failures with RHS unbound : 0
% 0.20/0.48 # BW rewrite match attempts : 1
% 0.20/0.48 # BW rewrite match successes : 1
% 0.20/0.48 # Condensation attempts : 0
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 1169
% 0.20/0.48 # Search garbage collected termcells : 40
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.005 s
% 0.20/0.48 # System time : 0.003 s
% 0.20/0.48 # Total time : 0.008 s
% 0.20/0.48 # Maximum resident set size: 1772 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.016 s
% 0.20/0.48 # System time : 0.010 s
% 0.20/0.48 # Total time : 0.026 s
% 0.20/0.48 # Maximum resident set size: 1700 pages
% 0.20/0.48 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------