TSTP Solution File: GRP012+5 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GRP012+5 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : 600s
% DateTime : Sat Jul 16 09:00:16 EDT 2022
% Result : Theorem 0.25s 1.44s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 27 ( 14 unt; 0 def)
% Number of atoms : 90 ( 0 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 90 ( 27 ~; 24 |; 31 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 105 ( 0 sgn 64 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_distribution,conjecture,
! [X1] :
( ( ! [X2,X3] :
? [X4] : product(X2,X3,X4)
& ! [X2,X3,X4,X5,X6,X7] :
( ( product(X2,X3,X5)
& product(X3,X4,X6)
& product(X5,X4,X7) )
=> product(X2,X6,X7) )
& ! [X2,X3,X4,X5,X6,X7] :
( ( product(X2,X3,X5)
& product(X3,X4,X6)
& product(X2,X6,X7) )
=> product(X5,X4,X7) )
& ! [X2] : product(X2,X1,X2)
& ! [X2] : product(X1,X2,X2)
& ! [X2] : product(X2,inverse(X2),X1)
& ! [X2] : product(inverse(X2),X2,X1) )
=> ! [X5,X6,X7,X2] :
( ( product(inverse(X5),inverse(X6),X7)
& product(X6,X5,X2) )
=> product(inverse(X7),inverse(X2),X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_distribution) ).
fof(c_0_1,negated_conjecture,
~ ! [X1] :
( ( ! [X2,X3] :
? [X4] : product(X2,X3,X4)
& ! [X2,X3,X4,X5,X6,X7] :
( ( product(X2,X3,X5)
& product(X3,X4,X6)
& product(X5,X4,X7) )
=> product(X2,X6,X7) )
& ! [X2,X3,X4,X5,X6,X7] :
( ( product(X2,X3,X5)
& product(X3,X4,X6)
& product(X2,X6,X7) )
=> product(X5,X4,X7) )
& ! [X2] : product(X2,X1,X2)
& ! [X2] : product(X1,X2,X2)
& ! [X2] : product(X2,inverse(X2),X1)
& ! [X2] : product(inverse(X2),X2,X1) )
=> ! [X5,X6,X7,X2] :
( ( product(inverse(X5),inverse(X6),X7)
& product(X6,X5,X2) )
=> product(inverse(X7),inverse(X2),X1) ) ),
inference(assume_negation,[status(cth)],[prove_distribution]) ).
fof(c_0_2,negated_conjecture,
! [X9,X10,X12,X13,X14,X15,X16,X17,X18,X19,X20,X21,X22,X23,X24,X25,X26,X27] :
( product(X9,X10,esk2_2(X9,X10))
& ( ~ product(X12,X13,X15)
| ~ product(X13,X14,X16)
| ~ product(X15,X14,X17)
| product(X12,X16,X17) )
& ( ~ product(X18,X19,X21)
| ~ product(X19,X20,X22)
| ~ product(X18,X22,X23)
| product(X21,X20,X23) )
& product(X24,esk1_0,X24)
& product(esk1_0,X25,X25)
& product(X26,inverse(X26),esk1_0)
& product(inverse(X27),X27,esk1_0)
& product(inverse(esk3_0),inverse(esk4_0),esk5_0)
& product(esk4_0,esk3_0,esk6_0)
& ~ product(inverse(esk5_0),inverse(esk6_0),esk1_0) ),
inference(shift_quantors,[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)],[c_0_1])])])])])]) ).
cnf(c_0_3,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X2,X5)
| ~ product(X4,X6,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
product(X1,inverse(X1),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X5,X2)
| ~ product(X1,X6,X4) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
product(inverse(esk3_0),inverse(esk4_0),esk5_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
( product(X1,inverse(X2),X3)
| ~ product(X4,esk1_0,X3)
| ~ product(X4,X2,X1) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_8,negated_conjecture,
product(X1,esk1_0,X1),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
( product(X1,esk5_0,X2)
| ~ product(X3,inverse(esk4_0),X2)
| ~ product(X1,inverse(esk3_0),X3) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( product(X1,inverse(X2),X3)
| ~ product(X3,X2,X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
product(esk4_0,esk3_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
( product(X1,esk5_0,esk1_0)
| ~ product(X1,inverse(esk3_0),esk4_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_4]) ).
cnf(c_0_13,negated_conjecture,
product(esk6_0,inverse(esk3_0),esk4_0),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
product(esk6_0,esk5_0,esk1_0),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,negated_conjecture,
product(inverse(X1),X1,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_16,negated_conjecture,
( product(X1,esk1_0,X2)
| ~ product(X3,inverse(X4),X2)
| ~ product(X1,X4,X3) ),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_17,negated_conjecture,
product(esk1_0,inverse(inverse(X1)),X1),
inference(spm,[status(thm)],[c_0_10,c_0_4]) ).
cnf(c_0_18,negated_conjecture,
product(esk1_0,inverse(esk5_0),esk6_0),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X4,inverse(X2),X1)
| ~ product(X4,esk1_0,X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( product(X1,esk1_0,X2)
| ~ product(X1,inverse(X2),esk1_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
product(esk6_0,inverse(inverse(esk5_0)),esk1_0),
inference(spm,[status(thm)],[c_0_10,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( product(esk1_0,X1,X2)
| ~ product(X1,esk1_0,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_4]) ).
cnf(c_0_23,negated_conjecture,
product(esk6_0,esk1_0,inverse(esk5_0)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
product(esk1_0,esk6_0,inverse(esk5_0)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
~ product(inverse(esk5_0),inverse(esk6_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_24]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GRP012+5 : TPTP v8.1.0. Released v3.1.0.
% 0.04/0.14 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 14 13:54:41 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.25/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.44 # Preprocessing time : 0.014 s
% 0.25/1.44
% 0.25/1.44 # Proof found!
% 0.25/1.44 # SZS status Theorem
% 0.25/1.44 # SZS output start CNFRefutation
% See solution above
% 0.25/1.44 # Proof object total steps : 27
% 0.25/1.44 # Proof object clause steps : 24
% 0.25/1.44 # Proof object formula steps : 3
% 0.25/1.44 # Proof object conjectures : 27
% 0.25/1.44 # Proof object clause conjectures : 24
% 0.25/1.44 # Proof object formula conjectures : 3
% 0.25/1.44 # Proof object initial clauses used : 8
% 0.25/1.44 # Proof object initial formulas used : 1
% 0.25/1.44 # Proof object generating inferences : 16
% 0.25/1.44 # Proof object simplifying inferences : 1
% 0.25/1.44 # Training examples: 0 positive, 0 negative
% 0.25/1.44 # Parsed axioms : 1
% 0.25/1.44 # Removed by relevancy pruning/SinE : 0
% 0.25/1.44 # Initial clauses : 10
% 0.25/1.44 # Removed in clause preprocessing : 0
% 0.25/1.44 # Initial clauses in saturation : 10
% 0.25/1.44 # Processed clauses : 148
% 0.25/1.44 # ...of these trivial : 0
% 0.25/1.44 # ...subsumed : 7
% 0.25/1.44 # ...remaining for further processing : 141
% 0.25/1.44 # Other redundant clauses eliminated : 0
% 0.25/1.44 # Clauses deleted for lack of memory : 0
% 0.25/1.44 # Backward-subsumed : 2
% 0.25/1.44 # Backward-rewritten : 2
% 0.25/1.44 # Generated clauses : 1107
% 0.25/1.44 # ...of the previous two non-trivial : 953
% 0.25/1.44 # Contextual simplify-reflections : 0
% 0.25/1.44 # Paramodulations : 1107
% 0.25/1.44 # Factorizations : 0
% 0.25/1.44 # Equation resolutions : 0
% 0.25/1.44 # Current number of processed clauses : 137
% 0.25/1.44 # Positive orientable unit clauses : 53
% 0.25/1.44 # Positive unorientable unit clauses: 0
% 0.25/1.44 # Negative unit clauses : 1
% 0.25/1.44 # Non-unit-clauses : 83
% 0.25/1.44 # Current number of unprocessed clauses: 788
% 0.25/1.44 # ...number of literals in the above : 1761
% 0.25/1.44 # Current number of archived formulas : 0
% 0.25/1.44 # Current number of archived clauses : 4
% 0.25/1.44 # Clause-clause subsumption calls (NU) : 646
% 0.25/1.44 # Rec. Clause-clause subsumption calls : 587
% 0.25/1.44 # Non-unit clause-clause subsumptions : 9
% 0.25/1.44 # Unit Clause-clause subsumption calls : 11
% 0.25/1.44 # Rewrite failures with RHS unbound : 0
% 0.25/1.44 # BW rewrite match attempts : 161
% 0.25/1.44 # BW rewrite match successes : 2
% 0.25/1.44 # Condensation attempts : 0
% 0.25/1.44 # Condensation successes : 0
% 0.25/1.44 # Termbank termtop insertions : 13150
% 0.25/1.44
% 0.25/1.44 # -------------------------------------------------
% 0.25/1.44 # User time : 0.041 s
% 0.25/1.44 # System time : 0.004 s
% 0.25/1.44 # Total time : 0.045 s
% 0.25/1.44 # Maximum resident set size: 3820 pages
%------------------------------------------------------------------------------