TSTP Solution File: GRP194+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP194+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:39:16 EDT 2023
% Result : Theorem 0.16s 0.43s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 9 unt; 0 def)
% Number of atoms : 82 ( 14 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 85 ( 36 ~; 35 |; 8 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 47 ( 1 sgn; 22 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(total_function,axiom,
! [X1,X2,X3] :
( ( group_member(X2,X1)
& group_member(X3,X1) )
=> group_member(multiply(X1,X2,X3),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.PP4bIYCJUy/E---3.1_31697.p',total_function) ).
fof(homomorphism2,axiom,
! [X2,X3] :
( ( group_member(X2,f)
& group_member(X3,f) )
=> multiply(h,phi(X2),phi(X3)) = phi(multiply(f,X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.PP4bIYCJUy/E---3.1_31697.p',homomorphism2) ).
fof(homomorphism1,axiom,
! [X2] :
( group_member(X2,f)
=> group_member(phi(X2),h) ),
file('/export/starexec/sandbox2/tmp/tmp.PP4bIYCJUy/E---3.1_31697.p',homomorphism1) ).
fof(left_zero,axiom,
! [X1,X2] :
( left_zero(X1,X2)
<=> ( group_member(X2,X1)
& ! [X3] :
( group_member(X3,X1)
=> multiply(X1,X2,X3) = X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.PP4bIYCJUy/E---3.1_31697.p',left_zero) ).
fof(surjective,axiom,
! [X2] :
( group_member(X2,h)
=> ? [X3] :
( group_member(X3,f)
& phi(X3) = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.PP4bIYCJUy/E---3.1_31697.p',surjective) ).
fof(left_zero_for_f,hypothesis,
left_zero(f,f_left_zero),
file('/export/starexec/sandbox2/tmp/tmp.PP4bIYCJUy/E---3.1_31697.p',left_zero_for_f) ).
fof(prove_left_zero_h,conjecture,
left_zero(h,phi(f_left_zero)),
file('/export/starexec/sandbox2/tmp/tmp.PP4bIYCJUy/E---3.1_31697.p',prove_left_zero_h) ).
fof(c_0_7,plain,
! [X16,X17,X18] :
( ~ group_member(X17,X16)
| ~ group_member(X18,X16)
| group_member(multiply(X16,X17,X18),X16) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[total_function])]) ).
fof(c_0_8,plain,
! [X12,X13] :
( ~ group_member(X12,f)
| ~ group_member(X13,f)
| multiply(h,phi(X12),phi(X13)) = phi(multiply(f,X12,X13)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[homomorphism2])]) ).
fof(c_0_9,plain,
! [X11] :
( ~ group_member(X11,f)
| group_member(phi(X11),h) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[homomorphism1])]) ).
fof(c_0_10,plain,
! [X5,X6,X7,X8,X9] :
( ( group_member(X6,X5)
| ~ left_zero(X5,X6) )
& ( ~ group_member(X7,X5)
| multiply(X5,X6,X7) = X6
| ~ left_zero(X5,X6) )
& ( group_member(esk1_2(X8,X9),X8)
| ~ group_member(X9,X8)
| left_zero(X8,X9) )
& ( multiply(X8,X9,esk1_2(X8,X9)) != X9
| ~ group_member(X9,X8)
| left_zero(X8,X9) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[left_zero])])])])])]) ).
fof(c_0_11,plain,
! [X14] :
( ( group_member(esk2_1(X14),f)
| ~ group_member(X14,h) )
& ( phi(esk2_1(X14)) = X14
| ~ group_member(X14,h) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[surjective])])])]) ).
cnf(c_0_12,plain,
( group_member(multiply(X2,X1,X3),X2)
| ~ group_member(X1,X2)
| ~ group_member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( multiply(h,phi(X1),phi(X2)) = phi(multiply(f,X1,X2))
| ~ group_member(X1,f)
| ~ group_member(X2,f) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( group_member(phi(X1),h)
| ~ group_member(X1,f) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( multiply(X2,X3,X1) = X3
| ~ group_member(X1,X2)
| ~ left_zero(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,hypothesis,
left_zero(f,f_left_zero),
inference(split_conjunct,[status(thm)],[left_zero_for_f]) ).
cnf(c_0_17,plain,
( group_member(X1,X2)
| ~ left_zero(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( phi(esk2_1(X1)) = X1
| ~ group_member(X1,h) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( group_member(esk2_1(X1),f)
| ~ group_member(X1,h) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
( group_member(phi(multiply(f,X1,X2)),h)
| ~ group_member(X2,f)
| ~ group_member(X1,f) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_14]) ).
cnf(c_0_21,hypothesis,
( multiply(f,f_left_zero,X1) = f_left_zero
| ~ group_member(X1,f) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,hypothesis,
group_member(f_left_zero,f),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_23,plain,
( phi(multiply(f,X1,esk2_1(X2))) = multiply(h,phi(X1),X2)
| ~ group_member(X1,f)
| ~ group_member(X2,h) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_18]),c_0_19]) ).
cnf(c_0_24,hypothesis,
( group_member(phi(f_left_zero),h)
| ~ group_member(X1,f) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
fof(c_0_25,negated_conjecture,
~ left_zero(h,phi(f_left_zero)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_left_zero_h])]) ).
cnf(c_0_26,plain,
( left_zero(X1,X2)
| multiply(X1,X2,esk1_2(X1,X2)) != X2
| ~ group_member(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_27,hypothesis,
( multiply(h,phi(f_left_zero),X1) = phi(f_left_zero)
| ~ group_member(X1,h) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_21]),c_0_22])]),c_0_19]) ).
cnf(c_0_28,hypothesis,
group_member(phi(f_left_zero),h),
inference(spm,[status(thm)],[c_0_24,c_0_22]) ).
cnf(c_0_29,negated_conjecture,
~ left_zero(h,phi(f_left_zero)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,hypothesis,
~ group_member(esk1_2(h,phi(f_left_zero)),h),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),c_0_29]) ).
cnf(c_0_31,plain,
( group_member(esk1_2(X1,X2),X1)
| left_zero(X1,X2)
| ~ group_member(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_32,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_28])]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : GRP194+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n017.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 01:51:41 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.PP4bIYCJUy/E---3.1_31697.p
% 0.16/0.43 # Version: 3.1pre001
% 0.16/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.43 # Starting sh5l with 300s (1) cores
% 0.16/0.43 # new_bool_3 with pid 31777 completed with status 0
% 0.16/0.43 # Result found by new_bool_3
% 0.16/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.43 # Search class: FGUSF-FFSF31-SFFFFFNN
% 0.16/0.43 # partial match(1): FGUSF-FFSF32-SFFFFFNN
% 0.16/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.43 # SAT001_MinMin_p005000_rr_RG with pid 31781 completed with status 0
% 0.16/0.43 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.43 # Search class: FGUSF-FFSF31-SFFFFFNN
% 0.16/0.43 # partial match(1): FGUSF-FFSF32-SFFFFFNN
% 0.16/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.43 # Preprocessing time : 0.001 s
% 0.16/0.43 # Presaturation interreduction done
% 0.16/0.43
% 0.16/0.43 # Proof found!
% 0.16/0.43 # SZS status Theorem
% 0.16/0.43 # SZS output start CNFRefutation
% See solution above
% 0.16/0.43 # Parsed axioms : 8
% 0.16/0.43 # Removed by relevancy pruning/SinE : 0
% 0.16/0.43 # Initial clauses : 12
% 0.16/0.43 # Removed in clause preprocessing : 0
% 0.16/0.43 # Initial clauses in saturation : 12
% 0.16/0.43 # Processed clauses : 41
% 0.16/0.43 # ...of these trivial : 0
% 0.16/0.43 # ...subsumed : 2
% 0.16/0.43 # ...remaining for further processing : 39
% 0.16/0.43 # Other redundant clauses eliminated : 0
% 0.16/0.43 # Clauses deleted for lack of memory : 0
% 0.16/0.43 # Backward-subsumed : 2
% 0.16/0.43 # Backward-rewritten : 3
% 0.16/0.43 # Generated clauses : 74
% 0.16/0.43 # ...of the previous two non-redundant : 65
% 0.16/0.43 # ...aggressively subsumed : 0
% 0.16/0.43 # Contextual simplify-reflections : 5
% 0.16/0.43 # Paramodulations : 74
% 0.16/0.43 # Factorizations : 0
% 0.16/0.43 # NegExts : 0
% 0.16/0.43 # Equation resolutions : 0
% 0.16/0.43 # Total rewrite steps : 43
% 0.16/0.43 # Propositional unsat checks : 0
% 0.16/0.43 # Propositional check models : 0
% 0.16/0.43 # Propositional check unsatisfiable : 0
% 0.16/0.43 # Propositional clauses : 0
% 0.16/0.43 # Propositional clauses after purity: 0
% 0.16/0.43 # Propositional unsat core size : 0
% 0.16/0.43 # Propositional preprocessing time : 0.000
% 0.16/0.43 # Propositional encoding time : 0.000
% 0.16/0.43 # Propositional solver time : 0.000
% 0.16/0.43 # Success case prop preproc time : 0.000
% 0.16/0.43 # Success case prop encoding time : 0.000
% 0.16/0.43 # Success case prop solver time : 0.000
% 0.16/0.43 # Current number of processed clauses : 22
% 0.16/0.43 # Positive orientable unit clauses : 4
% 0.16/0.43 # Positive unorientable unit clauses: 0
% 0.16/0.43 # Negative unit clauses : 2
% 0.16/0.43 # Non-unit-clauses : 16
% 0.16/0.43 # Current number of unprocessed clauses: 31
% 0.16/0.43 # ...number of literals in the above : 126
% 0.16/0.43 # Current number of archived formulas : 0
% 0.16/0.43 # Current number of archived clauses : 17
% 0.16/0.43 # Clause-clause subsumption calls (NU) : 56
% 0.16/0.43 # Rec. Clause-clause subsumption calls : 51
% 0.16/0.43 # Non-unit clause-clause subsumptions : 9
% 0.16/0.43 # Unit Clause-clause subsumption calls : 0
% 0.16/0.43 # Rewrite failures with RHS unbound : 0
% 0.16/0.43 # BW rewrite match attempts : 5
% 0.16/0.43 # BW rewrite match successes : 2
% 0.16/0.43 # Condensation attempts : 0
% 0.16/0.43 # Condensation successes : 0
% 0.16/0.43 # Termbank termtop insertions : 2155
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.005 s
% 0.16/0.43 # System time : 0.001 s
% 0.16/0.43 # Total time : 0.006 s
% 0.16/0.43 # Maximum resident set size: 1788 pages
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.008 s
% 0.16/0.43 # System time : 0.001 s
% 0.16/0.43 # Total time : 0.009 s
% 0.16/0.43 # Maximum resident set size: 1680 pages
% 0.16/0.43 % E---3.1 exiting
% 0.16/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------