TSTP Solution File: COM007+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : COM007+2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n009.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 : 13
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 10 unt; 0 def)
% Number of atoms : 80 ( 13 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 79 ( 36 ~; 33 |; 5 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-3 aty)
% Number of variables : 42 ( 0 sgn 20 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
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(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(equal_or_rewrite,axiom,
! [X1,X2] :
( reflexive_rewrite(X1,X2)
=> ( X1 = X2
| rewrite(X1,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',equal_or_rewrite) ).
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(equal_in_reflexive_rewrite,axiom,
! [X1,X2] :
( X1 = X2
=> reflexive_rewrite(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',equal_in_reflexive_rewrite) ).
fof(c_0_7,negated_conjecture,
~ goal,
inference(assume_negation,[status(cth)],[goal_to_be_proved]) ).
fof(c_0_8,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])])])]) ).
fof(c_0_9,negated_conjecture,
~ goal,
inference(fof_simplification,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( goal
| ~ reflexive_rewrite(c,X1)
| ~ reflexive_rewrite(b,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
~ goal,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X3,X4] :
( ~ rewrite(X3,X4)
| reflexive_rewrite(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rewrite_in_reflexive_rewrite])]) ).
cnf(c_0_13,plain,
( ~ reflexive_rewrite(b,X1)
| ~ reflexive_rewrite(c,X1) ),
inference(sr,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( reflexive_rewrite(X1,X2)
| ~ rewrite(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
( ~ rewrite(c,X1)
| ~ reflexive_rewrite(b,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_16,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])])])])])]) ).
cnf(c_0_17,plain,
( ~ rewrite(c,X1)
| ~ rewrite(b,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_18,plain,
( rewrite(X2,esk1_3(X1,X3,X2))
| ~ rewrite(X1,X2)
| ~ rewrite(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_19,plain,
! [X3,X4] :
( ~ reflexive_rewrite(X3,X4)
| X3 = X4
| rewrite(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_or_rewrite])]) ).
cnf(c_0_20,plain,
( ~ rewrite(b,esk1_3(X1,X2,c))
| ~ rewrite(X1,c)
| ~ rewrite(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
( rewrite(X3,esk1_3(X1,X3,X2))
| ~ rewrite(X1,X2)
| ~ rewrite(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( rewrite(X1,X2)
| X1 = X2
| ~ reflexive_rewrite(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
reflexive_rewrite(a,c),
inference(split_conjunct,[status(thm)],[assumption]) ).
cnf(c_0_24,plain,
( ~ rewrite(X1,c)
| ~ rewrite(X1,b) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( c = a
| rewrite(a,c) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
reflexive_rewrite(a,b),
inference(split_conjunct,[status(thm)],[assumption]) ).
cnf(c_0_27,plain,
( c = a
| ~ rewrite(a,b) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( a = b
| rewrite(a,b) ),
inference(spm,[status(thm)],[c_0_22,c_0_26]) ).
fof(c_0_29,plain,
! [X3,X4] :
( X3 != X4
| reflexive_rewrite(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_in_reflexive_rewrite])]) ).
cnf(c_0_30,plain,
( a = b
| c = a ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
( reflexive_rewrite(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_32,plain,
( a = b
| ~ reflexive_rewrite(b,X1)
| ~ reflexive_rewrite(a,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_30]) ).
cnf(c_0_33,plain,
reflexive_rewrite(X1,X1),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_34,plain,
a = b,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_26]),c_0_33])]) ).
cnf(c_0_35,plain,
~ reflexive_rewrite(b,c),
inference(spm,[status(thm)],[c_0_13,c_0_33]) ).
cnf(c_0_36,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_34]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : COM007+2 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 18:09:53 EDT 2022
% 0.12/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.013 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 : 7
% 0.23/1.42 # Removed by relevancy pruning/SinE : 4
% 0.23/1.42 # Initial clauses : 3
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 3
% 0.23/1.42 # Processed clauses : 5
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 0
% 0.23/1.42 # ...remaining for further processing : 5
% 0.23/1.42 # Other redundant clauses eliminated : 1
% 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 : 2
% 0.23/1.42 # ...of the previous two non-trivial : 2
% 0.23/1.42 # Contextual simplify-reflections : 0
% 0.23/1.42 # Paramodulations : 1
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 1
% 0.23/1.42 # Current number of processed clauses : 4
% 0.23/1.42 # Positive orientable unit clauses : 1
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 2
% 0.23/1.42 # Non-unit-clauses : 1
% 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) : 0
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 0
% 0.23/1.42 # Non-unit clause-clause subsumptions : 0
% 0.23/1.42 # Unit Clause-clause subsumption calls : 1
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 2
% 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 : 178
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.011 s
% 0.23/1.42 # System time : 0.002 s
% 0.23/1.42 # Total time : 0.013 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 : 37
% 0.23/1.42 # Proof object clause steps : 23
% 0.23/1.42 # Proof object formula steps : 14
% 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 : 9
% 0.23/1.42 # Proof object initial formulas used : 7
% 0.23/1.42 # Proof object generating inferences : 11
% 0.23/1.42 # Proof object simplifying inferences : 6
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 7
% 0.23/1.42 # Removed by relevancy pruning/SinE : 0
% 0.23/1.42 # Initial clauses : 9
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 9
% 0.23/1.42 # Processed clauses : 26
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 0
% 0.23/1.42 # ...remaining for further processing : 26
% 0.23/1.42 # Other redundant clauses eliminated : 1
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 0
% 0.23/1.42 # Backward-rewritten : 9
% 0.23/1.42 # Generated clauses : 29
% 0.23/1.42 # ...of the previous two non-trivial : 29
% 0.23/1.42 # Contextual simplify-reflections : 0
% 0.23/1.42 # Paramodulations : 28
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 1
% 0.23/1.42 # Current number of processed clauses : 16
% 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 : 4
% 0.23/1.42 # Non-unit-clauses : 10
% 0.23/1.42 # Current number of unprocessed clauses: 3
% 0.23/1.42 # ...number of literals in the above : 5
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 9
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 25
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 19
% 0.23/1.42 # Non-unit clause-clause subsumptions : 0
% 0.23/1.42 # Unit Clause-clause subsumption calls : 5
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 6
% 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 : 692
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.013 s
% 0.23/1.42 # System time : 0.002 s
% 0.23/1.42 # Total time : 0.015 s
% 0.23/1.42 # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------