%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GRP643+4 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n023.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:02:45 EDT 2022
% Result : Theorem 2.53s 26.72s
% Output : CNFRefutation 2.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 15 unt; 0 def)
% Number of atoms : 140 ( 0 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 174 ( 63 ~; 59 |; 32 &)
% ( 1 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 41 ( 0 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t21_latsubgr,conjecture,
! [X1] :
( ( ~ v3_struct_0(X1)
& v3_group_1(X1)
& v4_group_1(X1)
& l1_group_1(X1) )
=> ! [X2] :
( ( v1_group_1(X2)
& m1_group_2(X2,X1) )
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
=> ! [X4] :
( m1_subset_1(X4,u1_struct_0(X1))
=> ( ( r2_hidden(X3,k1_funct_1(k1_latsubgr(X1),X2))
& r2_hidden(X4,k1_funct_1(k1_latsubgr(X1),X2)) )
=> r2_hidden(k1_group_1(X1,X3,X4),k1_funct_1(k1_latsubgr(X1),X2)) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t21_latsubgr) ).
fof(t18_latsubgr,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v3_group_1(X1)
& v4_group_1(X1)
& l1_group_1(X1) )
=> ! [X2] :
( ( v1_group_1(X2)
& m1_group_2(X2,X1) )
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
=> ( r2_hidden(X3,k1_funct_1(k1_latsubgr(X1),X2))
<=> r1_rlvect_1(X2,X3) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t18_latsubgr) ).
fof(t59_group_2,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v3_group_1(X1)
& v4_group_1(X1)
& l1_group_1(X1) )
=> ! [X2] :
( m1_subset_1(X2,u1_struct_0(X1))
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
=> ! [X4] :
( m1_group_2(X4,X1)
=> ( ( r1_rlvect_1(X4,X2)
& r1_rlvect_1(X4,X3) )
=> r1_rlvect_1(X4,k1_group_1(X1,X2,X3)) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+246.ax',t59_group_2) ).
fof(dt_k1_group_1,axiom,
! [X1,X2,X3] :
( ( ~ v3_struct_0(X1)
& l1_group_1(X1)
& m1_subset_1(X2,u1_struct_0(X1))
& m1_subset_1(X3,u1_struct_0(X1)) )
=> m1_subset_1(k1_group_1(X1,X2,X3),u1_struct_0(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+212.ax',dt_k1_group_1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ( ~ v3_struct_0(X1)
& v3_group_1(X1)
& v4_group_1(X1)
& l1_group_1(X1) )
=> ! [X2] :
( ( v1_group_1(X2)
& m1_group_2(X2,X1) )
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
=> ! [X4] :
( m1_subset_1(X4,u1_struct_0(X1))
=> ( ( r2_hidden(X3,k1_funct_1(k1_latsubgr(X1),X2))
& r2_hidden(X4,k1_funct_1(k1_latsubgr(X1),X2)) )
=> r2_hidden(k1_group_1(X1,X3,X4),k1_funct_1(k1_latsubgr(X1),X2)) ) ) ) ) ),
inference(assume_negation,[status(cth)],[t21_latsubgr]) ).
fof(c_0_5,negated_conjecture,
( ~ v3_struct_0(esk1_0)
& v3_group_1(esk1_0)
& v4_group_1(esk1_0)
& l1_group_1(esk1_0)
& v1_group_1(esk2_0)
& m1_group_2(esk2_0,esk1_0)
& m1_subset_1(esk3_0,u1_struct_0(esk1_0))
& m1_subset_1(esk4_0,u1_struct_0(esk1_0))
& r2_hidden(esk3_0,k1_funct_1(k1_latsubgr(esk1_0),esk2_0))
& r2_hidden(esk4_0,k1_funct_1(k1_latsubgr(esk1_0),esk2_0))
& ~ r2_hidden(k1_group_1(esk1_0,esk3_0,esk4_0),k1_funct_1(k1_latsubgr(esk1_0),esk2_0)) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_4])])])])])]) ).
fof(c_0_6,plain,
! [X4,X5,X6] :
( ( ~ r2_hidden(X6,k1_funct_1(k1_latsubgr(X4),X5))
| r1_rlvect_1(X5,X6)
| ~ m1_subset_1(X6,u1_struct_0(X4))
| ~ v1_group_1(X5)
| ~ m1_group_2(X5,X4)
| v3_struct_0(X4)
| ~ v3_group_1(X4)
| ~ v4_group_1(X4)
| ~ l1_group_1(X4) )
& ( ~ r1_rlvect_1(X5,X6)
| r2_hidden(X6,k1_funct_1(k1_latsubgr(X4),X5))
| ~ m1_subset_1(X6,u1_struct_0(X4))
| ~ v1_group_1(X5)
| ~ m1_group_2(X5,X4)
| v3_struct_0(X4)
| ~ v3_group_1(X4)
| ~ v4_group_1(X4)
| ~ l1_group_1(X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t18_latsubgr])])])])])])]) ).
cnf(c_0_7,negated_conjecture,
~ r2_hidden(k1_group_1(esk1_0,esk3_0,esk4_0),k1_funct_1(k1_latsubgr(esk1_0),esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( v3_struct_0(X1)
| r2_hidden(X3,k1_funct_1(k1_latsubgr(X1),X2))
| ~ l1_group_1(X1)
| ~ v4_group_1(X1)
| ~ v3_group_1(X1)
| ~ m1_group_2(X2,X1)
| ~ v1_group_1(X2)
| ~ m1_subset_1(X3,u1_struct_0(X1))
| ~ r1_rlvect_1(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
m1_group_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
v4_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
v3_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
v1_group_1(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
l1_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_15,plain,
! [X5,X6,X7,X8] :
( v3_struct_0(X5)
| ~ v3_group_1(X5)
| ~ v4_group_1(X5)
| ~ l1_group_1(X5)
| ~ m1_subset_1(X6,u1_struct_0(X5))
| ~ m1_subset_1(X7,u1_struct_0(X5))
| ~ m1_group_2(X8,X5)
| ~ r1_rlvect_1(X8,X6)
| ~ r1_rlvect_1(X8,X7)
| r1_rlvect_1(X8,k1_group_1(X5,X6,X7)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t59_group_2])])])])])]) ).
cnf(c_0_16,plain,
( v3_struct_0(X1)
| r1_rlvect_1(X2,X3)
| ~ l1_group_1(X1)
| ~ v4_group_1(X1)
| ~ v3_group_1(X1)
| ~ m1_group_2(X2,X1)
| ~ v1_group_1(X2)
| ~ m1_subset_1(X3,u1_struct_0(X1))
| ~ r2_hidden(X3,k1_funct_1(k1_latsubgr(X1),X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
r2_hidden(esk4_0,k1_funct_1(k1_latsubgr(esk1_0),esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
m1_subset_1(esk4_0,u1_struct_0(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,negated_conjecture,
r2_hidden(esk3_0,k1_funct_1(k1_latsubgr(esk1_0),esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,negated_conjecture,
m1_subset_1(esk3_0,u1_struct_0(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_21,negated_conjecture,
( ~ r1_rlvect_1(esk2_0,k1_group_1(esk1_0,esk3_0,esk4_0))
| ~ m1_subset_1(k1_group_1(esk1_0,esk3_0,esk4_0),u1_struct_0(esk1_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10]),c_0_11]),c_0_12]),c_0_13])]),c_0_14]) ).
cnf(c_0_22,plain,
( r1_rlvect_1(X1,k1_group_1(X2,X3,X4))
| v3_struct_0(X2)
| ~ r1_rlvect_1(X1,X4)
| ~ r1_rlvect_1(X1,X3)
| ~ m1_group_2(X1,X2)
| ~ m1_subset_1(X4,u1_struct_0(X2))
| ~ m1_subset_1(X3,u1_struct_0(X2))
| ~ l1_group_1(X2)
| ~ v4_group_1(X2)
| ~ v3_group_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
r1_rlvect_1(esk2_0,esk4_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_9]),c_0_10]),c_0_11]),c_0_12]),c_0_13]),c_0_18])]),c_0_14]) ).
cnf(c_0_24,negated_conjecture,
r1_rlvect_1(esk2_0,esk3_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_19]),c_0_9]),c_0_10]),c_0_11]),c_0_12]),c_0_13]),c_0_20])]),c_0_14]) ).
fof(c_0_25,plain,
! [X4,X5,X6] :
( v3_struct_0(X4)
| ~ l1_group_1(X4)
| ~ m1_subset_1(X5,u1_struct_0(X4))
| ~ m1_subset_1(X6,u1_struct_0(X4))
| m1_subset_1(k1_group_1(X4,X5,X6),u1_struct_0(X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[dt_k1_group_1])])]) ).
cnf(c_0_26,negated_conjecture,
~ m1_subset_1(k1_group_1(esk1_0,esk3_0,esk4_0),u1_struct_0(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_9]),c_0_10]),c_0_11]),c_0_13]),c_0_23]),c_0_24]),c_0_18]),c_0_20])]),c_0_14]) ).
cnf(c_0_27,plain,
( m1_subset_1(k1_group_1(X1,X2,X3),u1_struct_0(X1))
| v3_struct_0(X1)
| ~ m1_subset_1(X3,u1_struct_0(X1))
| ~ m1_subset_1(X2,u1_struct_0(X1))
| ~ l1_group_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_13]),c_0_18]),c_0_20])]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP643+4 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n023.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 : Mon Jun 13 09:52:27 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.53/25.62 eprover: CPU time limit exceeded, terminating
% 2.53/25.62 eprover: CPU time limit exceeded, terminating
% 2.53/26.72 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 2.53/26.72 # Preprocessing time : 14.194 s
% 2.53/26.72
% 2.53/26.72 # Failure: Out of unprocessed clauses!
% 2.53/26.72 # OLD status GaveUp
% 2.53/26.72 # Parsed axioms : 36511
% 2.53/26.72 # Removed by relevancy pruning/SinE : 0
% 2.53/26.72 # Initial clauses : 110514
% 2.53/26.72 # Removed in clause preprocessing : 9201
% 2.53/26.72 # Initial clauses in saturation : 101313
% 2.53/26.72 # Processed clauses : 16
% 2.53/26.72 # ...of these trivial : 0
% 2.53/26.72 # ...subsumed : 3
% 2.53/26.72 # ...remaining for further processing : 13
% 2.53/26.72 # Other redundant clauses eliminated : 0
% 2.53/26.72 # Clauses deleted for lack of memory : 101298
% 2.53/26.72 # Backward-subsumed : 0
% 2.53/26.72 # Backward-rewritten : 1
% 2.53/26.72 # Generated clauses : 0
% 2.53/26.72 # ...of the previous two non-trivial : 1
% 2.53/26.72 # Contextual simplify-reflections : 0
% 2.53/26.72 # Paramodulations : 0
% 2.53/26.72 # Factorizations : 0
% 2.53/26.72 # Equation resolutions : 0
% 2.53/26.72 # Current number of processed clauses : 12
% 2.53/26.72 # Positive orientable unit clauses : 6
% 2.53/26.72 # Positive unorientable unit clauses: 0
% 2.53/26.72 # Negative unit clauses : 5
% 2.53/26.72 # Non-unit-clauses : 1
% 2.53/26.72 # Current number of unprocessed clauses: 0
% 2.53/26.72 # ...number of literals in the above : 0
% 2.53/26.72 # Current number of archived formulas : 0
% 2.53/26.72 # Current number of archived clauses : 1
% 2.53/26.72 # Clause-clause subsumption calls (NU) : 0
% 2.53/26.72 # Rec. Clause-clause subsumption calls : 0
% 2.53/26.72 # Non-unit clause-clause subsumptions : 0
% 2.53/26.72 # Unit Clause-clause subsumption calls : 6
% 2.53/26.72 # Rewrite failures with RHS unbound : 0
% 2.53/26.72 # BW rewrite match attempts : 1
% 2.53/26.72 # BW rewrite match successes : 1
% 2.53/26.72 # Condensation attempts : 0
% 2.53/26.72 # Condensation successes : 0
% 2.53/26.72 # Termbank termtop insertions : 11281094
% 2.53/26.72
% 2.53/26.72 # -------------------------------------------------
% 2.53/26.72 # User time : 21.006 s
% 2.53/26.72 # System time : 0.515 s
% 2.53/26.72 # Total time : 21.521 s
% 2.53/26.72 # Maximum resident set size: 445884 pages
% 2.53/26.72 # Running protocol protocol_eprover_f6eb5f7f05126ea361481ae651a4823314e3d740 for 23 seconds:
% 2.53/26.72 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 2.53/26.72 # Preprocessing time : 1.787 s
% 2.53/26.72
% 2.53/26.72 # Proof found!
% 2.53/26.72 # SZS status Theorem
% 2.53/26.72 # SZS output start CNFRefutation
% See solution above
% 2.53/26.72 # Proof object total steps : 29
% 2.53/26.72 # Proof object clause steps : 20
% 2.53/26.72 # Proof object formula steps : 9
% 2.53/26.72 # Proof object conjectures : 19
% 2.53/26.72 # Proof object clause conjectures : 16
% 2.53/26.72 # Proof object formula conjectures : 3
% 2.53/26.72 # Proof object initial clauses used : 15
% 2.53/26.72 # Proof object initial formulas used : 4
% 2.53/26.72 # Proof object generating inferences : 5
% 2.53/26.72 # Proof object simplifying inferences : 38
% 2.53/26.72 # Training examples: 0 positive, 0 negative
% 2.53/26.72 # Parsed axioms : 36511
% 2.53/26.72 # Removed by relevancy pruning/SinE : 36257
% 2.53/26.72 # Initial clauses : 766
% 2.53/26.72 # Removed in clause preprocessing : 74
% 2.53/26.72 # Initial clauses in saturation : 692
% 2.53/26.72 # Processed clauses : 778
% 2.53/26.72 # ...of these trivial : 5
% 2.53/26.72 # ...subsumed : 44
% 2.53/26.72 # ...remaining for further processing : 729
% 2.53/26.72 # Other redundant clauses eliminated : 10
% 2.53/26.72 # Clauses deleted for lack of memory : 0
% 2.53/26.72 # Backward-subsumed : 1
% 2.53/26.72 # Backward-rewritten : 9
% 2.53/26.72 # Generated clauses : 4451
% 2.53/26.72 # ...of the previous two non-trivial : 4088
% 2.53/26.72 # Contextual simplify-reflections : 62
% 2.53/26.72 # Paramodulations : 4427
% 2.53/26.72 # Factorizations : 2
% 2.53/26.72 # Equation resolutions : 23
% 2.53/26.72 # Current number of processed clauses : 714
% 2.53/26.72 # Positive orientable unit clauses : 72
% 2.53/26.72 # Positive unorientable unit clauses: 0
% 2.53/26.72 # Negative unit clauses : 18
% 2.53/26.72 # Non-unit-clauses : 624
% 2.53/26.72 # Current number of unprocessed clauses: 3945
% 2.53/26.72 # ...number of literals in the above : 34780
% 2.53/26.72 # Current number of archived formulas : 0
% 2.53/26.72 # Current number of archived clauses : 10
% 2.53/26.72 # Clause-clause subsumption calls (NU) : 238169
% 2.53/26.72 # Rec. Clause-clause subsumption calls : 13021
% 2.53/26.72 # Non-unit clause-clause subsumptions : 106
% 2.53/26.72 # Unit Clause-clause subsumption calls : 7605
% 2.53/26.72 # Rewrite failures with RHS unbound : 0
% 2.53/26.72 # BW rewrite match attempts : 24
% 2.53/26.72 # BW rewrite match successes : 5
% 2.53/26.72 # Condensation attempts : 0
% 2.53/26.72 # Condensation successes : 0
% 2.53/26.72 # Termbank termtop insertions : 1274213
% 2.53/26.72
% 2.53/26.72 # -------------------------------------------------
% 2.53/26.72 # User time : 2.098 s
% 2.53/26.72 # System time : 0.088 s
% 2.53/26.72 # Total time : 2.186 s
% 2.53/26.72 # Maximum resident set size: 90556 pages
%------------------------------------------------------------------------------