TSTP Solution File: GRP036-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP036-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:43:33 EDT 2023
% Result : Unsatisfiable 0.21s 0.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 22 ( 12 unt; 0 nHn; 18 RR)
% Number of literals : 38 ( 5 equ; 18 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 25 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(closure_of_product_and_inverse,axiom,
( subgroup_member(X3)
| ~ subgroup_member(X1)
| ~ subgroup_member(X2)
| ~ product(X1,inverse(X2),X3) ),
file('/export/starexec/sandbox2/tmp/tmp.ZTaOS2yZFE/E---3.1_12398.p',closure_of_product_and_inverse) ).
cnf(right_inverse,axiom,
product(X1,inverse(X1),identity),
file('/export/starexec/sandbox2/tmp/tmp.ZTaOS2yZFE/E---3.1_12398.p',right_inverse) ).
cnf(another_inverse_in_subgroup,hypothesis,
( subgroup_member(another_inverse(X1))
| ~ subgroup_member(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ZTaOS2yZFE/E---3.1_12398.p',another_inverse_in_subgroup) ).
cnf(another_identity_in_subgroup,hypothesis,
subgroup_member(another_identity),
file('/export/starexec/sandbox2/tmp/tmp.ZTaOS2yZFE/E---3.1_12398.p',another_identity_in_subgroup) ).
cnf(total_function2,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.ZTaOS2yZFE/E---3.1_12398.p',total_function2) ).
cnf(left_identity,axiom,
product(identity,X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.ZTaOS2yZFE/E---3.1_12398.p',left_identity) ).
cnf(another_right_identity,hypothesis,
( product(X1,another_identity,X1)
| ~ subgroup_member(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ZTaOS2yZFE/E---3.1_12398.p',another_right_identity) ).
cnf(prove_identity_equals_another_identity,negated_conjecture,
identity != another_identity,
file('/export/starexec/sandbox2/tmp/tmp.ZTaOS2yZFE/E---3.1_12398.p',prove_identity_equals_another_identity) ).
cnf(c_0_8,axiom,
( subgroup_member(X3)
| ~ subgroup_member(X1)
| ~ subgroup_member(X2)
| ~ product(X1,inverse(X2),X3) ),
closure_of_product_and_inverse ).
cnf(c_0_9,axiom,
product(X1,inverse(X1),identity),
right_inverse ).
cnf(c_0_10,hypothesis,
( subgroup_member(another_inverse(X1))
| ~ subgroup_member(X1) ),
another_inverse_in_subgroup ).
cnf(c_0_11,hypothesis,
subgroup_member(another_identity),
another_identity_in_subgroup ).
cnf(c_0_12,plain,
( subgroup_member(identity)
| ~ subgroup_member(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,hypothesis,
subgroup_member(another_inverse(another_identity)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
total_function2 ).
cnf(c_0_15,axiom,
product(identity,X1,X1),
left_identity ).
cnf(c_0_16,hypothesis,
( product(X1,another_identity,X1)
| ~ subgroup_member(X1) ),
another_right_identity ).
cnf(c_0_17,hypothesis,
subgroup_member(identity),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( X1 = X2
| ~ product(identity,X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,hypothesis,
product(identity,another_identity,identity),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
identity != another_identity,
prove_identity_equals_another_identity ).
cnf(c_0_21,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP036-3 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 02:31:46 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.ZTaOS2yZFE/E---3.1_12398.p
% 0.21/0.49 # Version: 3.1pre001
% 0.21/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.49 # Starting sh5l with 300s (1) cores
% 0.21/0.49 # sh5l with pid 12489 completed with status 0
% 0.21/0.49 # Result found by sh5l
% 0.21/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.49 # Starting sh5l with 300s (1) cores
% 0.21/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.49 # Search class: FHUSM-FFSF11-SFFFFFNN
% 0.21/0.49 # partial match(1): FHUSM-FFSF21-SFFFFFNN
% 0.21/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 0.21/0.49 # G-E--_208_C18_F1_AE_CS_SP_PI_S0a with pid 12497 completed with status 0
% 0.21/0.49 # Result found by G-E--_208_C18_F1_AE_CS_SP_PI_S0a
% 0.21/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.49 # Starting sh5l with 300s (1) cores
% 0.21/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.49 # Search class: FHUSM-FFSF11-SFFFFFNN
% 0.21/0.49 # partial match(1): FHUSM-FFSF21-SFFFFFNN
% 0.21/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 0.21/0.49 # Preprocessing time : 0.001 s
% 0.21/0.49
% 0.21/0.49 # Proof found!
% 0.21/0.49 # SZS status Unsatisfiable
% 0.21/0.49 # SZS output start CNFRefutation
% See solution above
% 0.21/0.49 # Parsed axioms : 16
% 0.21/0.49 # Removed by relevancy pruning/SinE : 1
% 0.21/0.49 # Initial clauses : 15
% 0.21/0.49 # Removed in clause preprocessing : 0
% 0.21/0.49 # Initial clauses in saturation : 15
% 0.21/0.49 # Processed clauses : 25
% 0.21/0.49 # ...of these trivial : 2
% 0.21/0.49 # ...subsumed : 0
% 0.21/0.49 # ...remaining for further processing : 23
% 0.21/0.49 # Other redundant clauses eliminated : 0
% 0.21/0.49 # Clauses deleted for lack of memory : 0
% 0.21/0.49 # Backward-subsumed : 0
% 0.21/0.49 # Backward-rewritten : 1
% 0.21/0.49 # Generated clauses : 74
% 0.21/0.49 # ...of the previous two non-redundant : 71
% 0.21/0.49 # ...aggressively subsumed : 0
% 0.21/0.49 # Contextual simplify-reflections : 0
% 0.21/0.49 # Paramodulations : 74
% 0.21/0.49 # Factorizations : 0
% 0.21/0.49 # NegExts : 0
% 0.21/0.49 # Equation resolutions : 0
% 0.21/0.49 # Total rewrite steps : 6
% 0.21/0.49 # Propositional unsat checks : 0
% 0.21/0.49 # Propositional check models : 0
% 0.21/0.49 # Propositional check unsatisfiable : 0
% 0.21/0.49 # Propositional clauses : 0
% 0.21/0.49 # Propositional clauses after purity: 0
% 0.21/0.49 # Propositional unsat core size : 0
% 0.21/0.49 # Propositional preprocessing time : 0.000
% 0.21/0.49 # Propositional encoding time : 0.000
% 0.21/0.49 # Propositional solver time : 0.000
% 0.21/0.49 # Success case prop preproc time : 0.000
% 0.21/0.49 # Success case prop encoding time : 0.000
% 0.21/0.49 # Success case prop solver time : 0.000
% 0.21/0.49 # Current number of processed clauses : 22
% 0.21/0.49 # Positive orientable unit clauses : 10
% 0.21/0.49 # Positive unorientable unit clauses: 0
% 0.21/0.49 # Negative unit clauses : 1
% 0.21/0.49 # Non-unit-clauses : 11
% 0.21/0.49 # Current number of unprocessed clauses: 52
% 0.21/0.49 # ...number of literals in the above : 126
% 0.21/0.49 # Current number of archived formulas : 0
% 0.21/0.49 # Current number of archived clauses : 1
% 0.21/0.49 # Clause-clause subsumption calls (NU) : 20
% 0.21/0.49 # Rec. Clause-clause subsumption calls : 18
% 0.21/0.49 # Non-unit clause-clause subsumptions : 0
% 0.21/0.49 # Unit Clause-clause subsumption calls : 0
% 0.21/0.49 # Rewrite failures with RHS unbound : 0
% 0.21/0.49 # BW rewrite match attempts : 1
% 0.21/0.49 # BW rewrite match successes : 1
% 0.21/0.49 # Condensation attempts : 0
% 0.21/0.49 # Condensation successes : 0
% 0.21/0.49 # Termbank termtop insertions : 944
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.002 s
% 0.21/0.49 # System time : 0.003 s
% 0.21/0.49 # Total time : 0.005 s
% 0.21/0.49 # Maximum resident set size: 1636 pages
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.002 s
% 0.21/0.49 # System time : 0.006 s
% 0.21/0.49 # Total time : 0.009 s
% 0.21/0.49 # Maximum resident set size: 1680 pages
% 0.21/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------