TSTP Solution File: COM007+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : COM007+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n012.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 : 600s
% DateTime : Fri Jul 15 01:14:00 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 49 ( 15 unt; 0 def)
% Number of atoms : 110 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 108 ( 47 ~; 48 |; 6 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-3 aty)
% Number of variables : 72 ( 0 sgn 32 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(rewrite_in_reflexive_rewrite,axiom,
! [X1,X2] :
( rewrite(X1,X2)
=> reflexive_rewrite(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rewrite_in_reflexive_rewrite) ).
fof(rewrite_diamond,axiom,
! [X1,X2,X3] :
( ( rewrite(X1,X2)
& rewrite(X1,X3) )
=> ? [X4] :
( rewrite(X2,X4)
& rewrite(X3,X4) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rewrite_diamond) ).
fof(goal_to_be_proved,conjecture,
goal,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goal_to_be_proved) ).
fof(goal_ax,axiom,
! [X1] :
( ( reflexive_rewrite(b,X1)
& reflexive_rewrite(c,X1) )
=> goal ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goal_ax) ).
fof(symmtery,axiom,
! [X1,X2] :
( equalish(X1,X2)
=> equalish(X2,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',symmtery) ).
fof(equalish_or_rewrite,axiom,
! [X1,X2] :
( reflexive_rewrite(X1,X2)
=> ( equalish(X1,X2)
| rewrite(X1,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',equalish_or_rewrite) ).
fof(equalish_in_reflexive_rewrite,axiom,
! [X1,X2] :
( equalish(X1,X2)
=> reflexive_rewrite(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',equalish_in_reflexive_rewrite) ).
fof(substitution,axiom,
! [X1,X2,X3] :
( ( equalish(X1,X2)
& reflexive_rewrite(X2,X3) )
=> reflexive_rewrite(X1,X3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',substitution) ).
fof(reflexivity,axiom,
! [X1] : equalish(X1,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',reflexivity) ).
fof(assumption,axiom,
( reflexive_rewrite(a,b)
& reflexive_rewrite(a,c) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',assumption) ).
fof(c_0_10,plain,
! [X3,X4] :
( ~ rewrite(X3,X4)
| reflexive_rewrite(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rewrite_in_reflexive_rewrite])]) ).
fof(c_0_11,plain,
! [X5,X6,X7] :
( ( rewrite(X6,esk1_3(X5,X6,X7))
| ~ rewrite(X5,X6)
| ~ rewrite(X5,X7) )
& ( rewrite(X7,esk1_3(X5,X6,X7))
| ~ rewrite(X5,X6)
| ~ rewrite(X5,X7) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rewrite_diamond])])])])])]) ).
fof(c_0_12,negated_conjecture,
~ goal,
inference(assume_negation,[status(cth)],[goal_to_be_proved]) ).
fof(c_0_13,plain,
! [X2] :
( ~ reflexive_rewrite(b,X2)
| ~ reflexive_rewrite(c,X2)
| goal ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[goal_ax])])])]) ).
cnf(c_0_14,plain,
( reflexive_rewrite(X1,X2)
| ~ rewrite(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( rewrite(X3,esk1_3(X1,X3,X2))
| ~ rewrite(X1,X2)
| ~ rewrite(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,negated_conjecture,
~ goal,
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X3,X4] :
( ~ equalish(X3,X4)
| equalish(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmtery])]) ).
fof(c_0_18,plain,
! [X3,X4] :
( ~ reflexive_rewrite(X3,X4)
| equalish(X3,X4)
| rewrite(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equalish_or_rewrite])]) ).
cnf(c_0_19,plain,
( goal
| ~ reflexive_rewrite(c,X1)
| ~ reflexive_rewrite(b,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( reflexive_rewrite(X1,esk1_3(X2,X1,X3))
| ~ rewrite(X2,X1)
| ~ rewrite(X2,X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
~ goal,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( rewrite(X2,esk1_3(X1,X3,X2))
| ~ rewrite(X1,X2)
| ~ rewrite(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_23,plain,
! [X3,X4] :
( ~ equalish(X3,X4)
| reflexive_rewrite(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equalish_in_reflexive_rewrite])]) ).
cnf(c_0_24,plain,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( rewrite(X1,X2)
| equalish(X1,X2)
| ~ reflexive_rewrite(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_26,plain,
! [X4,X5,X6] :
( ~ equalish(X4,X5)
| ~ reflexive_rewrite(X5,X6)
| reflexive_rewrite(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[substitution])]) ).
fof(c_0_27,plain,
! [X2] : equalish(X2,X2),
inference(variable_rename,[status(thm)],[reflexivity]) ).
cnf(c_0_28,plain,
( ~ rewrite(X1,c)
| ~ rewrite(X1,X2)
| ~ reflexive_rewrite(b,esk1_3(X1,c,X2)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_29,plain,
( reflexive_rewrite(X1,esk1_3(X2,X3,X1))
| ~ rewrite(X2,X3)
| ~ rewrite(X2,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_22]) ).
cnf(c_0_30,plain,
( reflexive_rewrite(X1,X2)
| ~ equalish(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,plain,
( rewrite(X1,X2)
| equalish(X2,X1)
| ~ reflexive_rewrite(X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,plain,
( reflexive_rewrite(X1,X2)
| ~ reflexive_rewrite(X3,X2)
| ~ equalish(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,plain,
equalish(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,plain,
( ~ rewrite(X1,c)
| ~ rewrite(X1,b) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
( rewrite(X1,X2)
| reflexive_rewrite(X2,X1)
| ~ reflexive_rewrite(X1,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
( rewrite(X1,X2)
| reflexive_rewrite(X2,X3)
| ~ reflexive_rewrite(X1,X3)
| ~ reflexive_rewrite(X1,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_31]) ).
cnf(c_0_37,plain,
reflexive_rewrite(a,c),
inference(split_conjunct,[status(thm)],[assumption]) ).
cnf(c_0_38,plain,
reflexive_rewrite(X1,X1),
inference(spm,[status(thm)],[c_0_30,c_0_33]) ).
cnf(c_0_39,plain,
reflexive_rewrite(a,b),
inference(split_conjunct,[status(thm)],[assumption]) ).
cnf(c_0_40,plain,
( reflexive_rewrite(c,X1)
| ~ rewrite(X1,b)
| ~ reflexive_rewrite(X1,c) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,plain,
( rewrite(a,X1)
| reflexive_rewrite(X1,c)
| ~ reflexive_rewrite(a,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
~ reflexive_rewrite(b,c),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_38]),c_0_21]) ).
cnf(c_0_43,plain,
( rewrite(a,X1)
| reflexive_rewrite(X1,b)
| ~ reflexive_rewrite(a,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_39]) ).
cnf(c_0_44,plain,
reflexive_rewrite(c,a),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_37]),c_0_39])]),c_0_42]) ).
cnf(c_0_45,plain,
( reflexive_rewrite(c,b)
| ~ rewrite(a,b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_43]),c_0_37])]) ).
cnf(c_0_46,plain,
~ reflexive_rewrite(b,a),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_44]),c_0_21]) ).
cnf(c_0_47,plain,
reflexive_rewrite(c,b),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_35]),c_0_39])]),c_0_46]) ).
cnf(c_0_48,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_47]),c_0_38])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : COM007+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n012.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 : 600
% 0.13/0.34 % DateTime : Thu Jun 16 19:52:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.014 s
% 0.23/1.42
% 0.23/1.42 # Failure: Out of unprocessed clauses!
% 0.23/1.42 # OLD status GaveUp
% 0.23/1.42 # Parsed axioms : 10
% 0.23/1.42 # Removed by relevancy pruning/SinE : 4
% 0.23/1.42 # Initial clauses : 6
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 6
% 0.23/1.42 # Processed clauses : 8
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 0
% 0.23/1.42 # ...remaining for further processing : 8
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 0
% 0.23/1.42 # Backward-rewritten : 0
% 0.23/1.42 # Generated clauses : 4
% 0.23/1.42 # ...of the previous two non-trivial : 2
% 0.23/1.42 # Contextual simplify-reflections : 0
% 0.23/1.42 # Paramodulations : 4
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 8
% 0.23/1.42 # Positive orientable unit clauses : 2
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 2
% 0.23/1.42 # Non-unit-clauses : 4
% 0.23/1.42 # Current number of unprocessed clauses: 0
% 0.23/1.42 # ...number of literals in the above : 0
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 0
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 2
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 2
% 0.23/1.42 # Non-unit clause-clause subsumptions : 0
% 0.23/1.42 # Unit Clause-clause subsumption calls : 3
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 4
% 0.23/1.42 # BW rewrite match successes : 0
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 366
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.011 s
% 0.23/1.42 # System time : 0.003 s
% 0.23/1.42 # Total time : 0.014 s
% 0.23/1.42 # Maximum resident set size: 2772 pages
% 0.23/1.42 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.23/1.42 # Preprocessing time : 0.014 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 49
% 0.23/1.42 # Proof object clause steps : 29
% 0.23/1.42 # Proof object formula steps : 20
% 0.23/1.42 # Proof object conjectures : 4
% 0.23/1.42 # Proof object clause conjectures : 1
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 12
% 0.23/1.42 # Proof object initial formulas used : 10
% 0.23/1.42 # Proof object generating inferences : 17
% 0.23/1.42 # Proof object simplifying inferences : 15
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 10
% 0.23/1.42 # Removed by relevancy pruning/SinE : 0
% 0.23/1.42 # Initial clauses : 12
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 12
% 0.23/1.42 # Processed clauses : 37
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 3
% 0.23/1.42 # ...remaining for further processing : 34
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 0
% 0.23/1.42 # Backward-rewritten : 1
% 0.23/1.42 # Generated clauses : 53
% 0.23/1.42 # ...of the previous two non-trivial : 38
% 0.23/1.42 # Contextual simplify-reflections : 0
% 0.23/1.42 # Paramodulations : 53
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 33
% 0.23/1.42 # Positive orientable unit clauses : 6
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 3
% 0.23/1.42 # Non-unit-clauses : 24
% 0.23/1.42 # Current number of unprocessed clauses: 12
% 0.23/1.42 # ...number of literals in the above : 54
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 1
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 71
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 57
% 0.23/1.42 # Non-unit clause-clause subsumptions : 3
% 0.23/1.42 # Unit Clause-clause subsumption calls : 17
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 9
% 0.23/1.42 # BW rewrite match successes : 1
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 1288
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.015 s
% 0.23/1.42 # System time : 0.001 s
% 0.23/1.42 # Total time : 0.016 s
% 0.23/1.42 # Maximum resident set size: 2776 pages
%------------------------------------------------------------------------------