TSTP Solution File: GRP642+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP642+3 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:42:28 EDT 2023
% Result : Theorem 5.07s 4.17s
% Output : CNFRefutation 5.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 12 unt; 0 def)
% Number of atoms : 67 ( 4 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 70 ( 25 ~; 14 |; 23 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 22 ( 2 sgn; 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t19_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) )
=> r2_hidden(k2_group_1(X1),k1_funct_1(k1_latsubgr(X1),X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.xL6MHFfBM8/E---3.1_29483.p',t19_latsubgr) ).
fof(t20_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) )
=> k1_funct_1(k1_latsubgr(X1),X2) != k1_xboole_0 ) ),
file('/export/starexec/sandbox/tmp/tmp.xL6MHFfBM8/E---3.1_29483.p',t20_latsubgr) ).
fof(t7_ordinal1,axiom,
! [X1,X2] :
~ ( r2_hidden(X1,X2)
& r1_tarski(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.xL6MHFfBM8/E---3.1_29483.p',t7_ordinal1) ).
fof(t2_xboole_1,axiom,
! [X1] : r1_tarski(k1_xboole_0,X1),
file('/export/starexec/sandbox/tmp/tmp.xL6MHFfBM8/E---3.1_29483.p',t2_xboole_1) ).
fof(c_0_4,plain,
! [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) )
=> r2_hidden(k2_group_1(X1),k1_funct_1(k1_latsubgr(X1),X2)) ) ),
inference(fof_simplification,[status(thm)],[t19_latsubgr]) ).
fof(c_0_5,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) )
=> k1_funct_1(k1_latsubgr(X1),X2) != k1_xboole_0 ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t20_latsubgr])]) ).
fof(c_0_6,plain,
! [X239,X240] :
( ~ r2_hidden(X239,X240)
| ~ r1_tarski(X240,X239) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_ordinal1])]) ).
fof(c_0_7,plain,
! [X23] : r1_tarski(k1_xboole_0,X23),
inference(variable_rename,[status(thm)],[t2_xboole_1]) ).
fof(c_0_8,plain,
! [X117,X118] :
( v3_struct_0(X117)
| ~ v3_group_1(X117)
| ~ v4_group_1(X117)
| ~ l1_group_1(X117)
| ~ v1_group_1(X118)
| ~ m1_group_2(X118,X117)
| r2_hidden(k2_group_1(X117),k1_funct_1(k1_latsubgr(X117),X118)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_9,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)
& k1_funct_1(k1_latsubgr(esk1_0),esk2_0) = k1_xboole_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_10,plain,
( ~ r2_hidden(X1,X2)
| ~ r1_tarski(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
r1_tarski(k1_xboole_0,X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( v3_struct_0(X1)
| r2_hidden(k2_group_1(X1),k1_funct_1(k1_latsubgr(X1),X2))
| ~ v3_group_1(X1)
| ~ v4_group_1(X1)
| ~ l1_group_1(X1)
| ~ v1_group_1(X2)
| ~ m1_group_2(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
k1_funct_1(k1_latsubgr(esk1_0),esk2_0) = k1_xboole_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
m1_group_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
v4_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
v3_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
v1_group_1(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,negated_conjecture,
l1_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,plain,
~ r2_hidden(X1,k1_xboole_0),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[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_12,c_0_13]),c_0_14]),c_0_15]),c_0_16]),c_0_17]),c_0_18])]),c_0_19]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 1.07/1.09 % Problem : GRP642+3 : TPTP v8.1.2. Released v3.4.0.
% 1.07/1.10 % Command : run_E %s %d THM
% 1.09/1.30 % Computer : n009.cluster.edu
% 1.09/1.30 % Model : x86_64 x86_64
% 1.09/1.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 1.09/1.30 % Memory : 8042.1875MB
% 1.09/1.30 % OS : Linux 3.10.0-693.el7.x86_64
% 1.09/1.30 % CPULimit : 2400
% 1.09/1.30 % WCLimit : 300
% 1.09/1.30 % DateTime : Tue Oct 3 02:16:47 EDT 2023
% 1.09/1.30 % CPUTime :
% 3.40/3.62 Running first-order theorem proving
% 3.40/3.62 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.xL6MHFfBM8/E---3.1_29483.p
% 5.07/4.17 # Version: 3.1pre001
% 5.07/4.17 # Preprocessing class: FMLLSMLLSSSNFFN.
% 5.07/4.17 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.07/4.17 # Starting new_bool_3 with 900s (3) cores
% 5.07/4.17 # Starting new_bool_1 with 900s (3) cores
% 5.07/4.17 # Starting sh5l with 300s (1) cores
% 5.07/4.17 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 5.07/4.17 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 29795 completed with status 0
% 5.07/4.17 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 5.07/4.17 # Preprocessing class: FMLLSMLLSSSNFFN.
% 5.07/4.17 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.07/4.17 # Starting new_bool_3 with 900s (3) cores
% 5.07/4.17 # Starting new_bool_1 with 900s (3) cores
% 5.07/4.17 # Starting sh5l with 300s (1) cores
% 5.07/4.17 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 5.07/4.17 # SinE strategy is gf120_gu_R02_F100_L20000
% 5.07/4.17 # Search class: FGHSM-FSLM31-SFFFFFNN
% 5.07/4.17 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 5.07/4.17 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 163s (1) cores
% 5.07/4.17 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 29796 completed with status 0
% 5.07/4.17 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 5.07/4.17 # Preprocessing class: FMLLSMLLSSSNFFN.
% 5.07/4.17 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.07/4.17 # Starting new_bool_3 with 900s (3) cores
% 5.07/4.17 # Starting new_bool_1 with 900s (3) cores
% 5.07/4.17 # Starting sh5l with 300s (1) cores
% 5.07/4.17 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 5.07/4.17 # SinE strategy is gf120_gu_R02_F100_L20000
% 5.07/4.17 # Search class: FGHSM-FSLM31-SFFFFFNN
% 5.07/4.17 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 5.07/4.17 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 163s (1) cores
% 5.07/4.17 # Preprocessing time : 0.016 s
% 5.07/4.17
% 5.07/4.17 # Proof found!
% 5.07/4.17 # SZS status Theorem
% 5.07/4.17 # SZS output start CNFRefutation
% See solution above
% 5.07/4.17 # Parsed axioms : 13984
% 5.07/4.17 # Removed by relevancy pruning/SinE : 13849
% 5.07/4.17 # Initial clauses : 248
% 5.07/4.17 # Removed in clause preprocessing : 10
% 5.07/4.17 # Initial clauses in saturation : 238
% 5.07/4.17 # Processed clauses : 259
% 5.07/4.17 # ...of these trivial : 3
% 5.07/4.17 # ...subsumed : 11
% 5.07/4.17 # ...remaining for further processing : 244
% 5.07/4.17 # Other redundant clauses eliminated : 3
% 5.07/4.17 # Clauses deleted for lack of memory : 0
% 5.07/4.17 # Backward-subsumed : 1
% 5.07/4.17 # Backward-rewritten : 8
% 5.07/4.17 # Generated clauses : 776
% 5.07/4.17 # ...of the previous two non-redundant : 664
% 5.07/4.17 # ...aggressively subsumed : 0
% 5.07/4.17 # Contextual simplify-reflections : 7
% 5.07/4.17 # Paramodulations : 765
% 5.07/4.17 # Factorizations : 2
% 5.07/4.17 # NegExts : 0
% 5.07/4.17 # Equation resolutions : 9
% 5.07/4.17 # Total rewrite steps : 203
% 5.07/4.17 # Propositional unsat checks : 0
% 5.07/4.17 # Propositional check models : 0
% 5.07/4.17 # Propositional check unsatisfiable : 0
% 5.07/4.17 # Propositional clauses : 0
% 5.07/4.17 # Propositional clauses after purity: 0
% 5.07/4.17 # Propositional unsat core size : 0
% 5.07/4.17 # Propositional preprocessing time : 0.000
% 5.07/4.17 # Propositional encoding time : 0.000
% 5.07/4.17 # Propositional solver time : 0.000
% 5.07/4.17 # Success case prop preproc time : 0.000
% 5.07/4.17 # Success case prop encoding time : 0.000
% 5.07/4.17 # Success case prop solver time : 0.000
% 5.07/4.17 # Current number of processed clauses : 232
% 5.07/4.17 # Positive orientable unit clauses : 34
% 5.07/4.17 # Positive unorientable unit clauses: 0
% 5.07/4.17 # Negative unit clauses : 10
% 5.07/4.17 # Non-unit-clauses : 188
% 5.07/4.17 # Current number of unprocessed clauses: 639
% 5.07/4.17 # ...number of literals in the above : 3399
% 5.07/4.17 # Current number of archived formulas : 0
% 5.07/4.17 # Current number of archived clauses : 9
% 5.07/4.17 # Clause-clause subsumption calls (NU) : 10157
% 5.07/4.17 # Rec. Clause-clause subsumption calls : 1438
% 5.07/4.17 # Non-unit clause-clause subsumptions : 19
% 5.07/4.17 # Unit Clause-clause subsumption calls : 1051
% 5.07/4.17 # Rewrite failures with RHS unbound : 0
% 5.07/4.17 # BW rewrite match attempts : 5
% 5.07/4.17 # BW rewrite match successes : 4
% 5.07/4.17 # Condensation attempts : 0
% 5.07/4.17 # Condensation successes : 0
% 5.07/4.17 # Termbank termtop insertions : 373197
% 5.07/4.17
% 5.07/4.17 # -------------------------------------------------
% 5.07/4.17 # User time : 0.184 s
% 5.07/4.17 # System time : 0.047 s
% 5.07/4.17 # Total time : 0.231 s
% 5.07/4.17 # Maximum resident set size: 26840 pages
% 5.07/4.17
% 5.07/4.17 # -------------------------------------------------
% 5.07/4.17 # User time : 0.461 s
% 5.07/4.17 # System time : 0.066 s
% 5.07/4.17 # Total time : 0.527 s
% 5.07/4.17 # Maximum resident set size: 20632 pages
% 5.07/4.17 % E---3.1 exiting
% 5.07/4.19 % E---3.1 exiting
%------------------------------------------------------------------------------