TSTP Solution File: GRP135-1.002 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP135-1.002 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:46:20 EDT 2023
% Result : Unsatisfiable 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of clauses : 36 ( 13 unt; 13 nHn; 36 RR)
% Number of literals : 74 ( 0 equ; 29 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 37 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(product_total_function1,axiom,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| ~ group_element(X1)
| ~ group_element(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.0vdUN7yBmJ/E---3.1_9182.p',product_total_function1) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox2/tmp/tmp.0vdUN7yBmJ/E---3.1_9182.p',element_2) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox2/tmp/tmp.0vdUN7yBmJ/E---3.1_9182.p',element_1) ).
cnf(qg3,negated_conjecture,
( product(X4,X1,X2)
| ~ product(X1,X2,X3)
| ~ product(X3,X1,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.0vdUN7yBmJ/E---3.1_9182.p',qg3) ).
cnf(product_right_cancellation,axiom,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.0vdUN7yBmJ/E---3.1_9182.p',product_right_cancellation) ).
cnf(e_1_is_not_e_2,axiom,
~ equalish(e_1,e_2),
file('/export/starexec/sandbox2/tmp/tmp.0vdUN7yBmJ/E---3.1_9182.p',e_1_is_not_e_2) ).
cnf(product_left_cancellation,axiom,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.0vdUN7yBmJ/E---3.1_9182.p',product_left_cancellation) ).
cnf(c_0_7,axiom,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| ~ group_element(X1)
| ~ group_element(X2) ),
product_total_function1 ).
cnf(c_0_8,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_9,plain,
( product(X1,e_2,e_2)
| product(X1,e_2,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_11,negated_conjecture,
( product(X4,X1,X2)
| ~ product(X1,X2,X3)
| ~ product(X3,X1,X4) ),
qg3 ).
cnf(c_0_12,plain,
( product(e_1,e_2,e_1)
| product(e_1,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( product(e_1,e_2,e_2)
| product(e_1,e_2,X1)
| ~ product(e_2,X1,e_1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
( product(e_2,e_2,e_1)
| product(e_2,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_15,negated_conjecture,
( product(e_2,e_2,e_2)
| product(e_1,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,negated_conjecture,
( product(e_2,e_2,e_2)
| product(e_2,e_2,X1)
| ~ product(e_2,X1,e_1) ),
inference(spm,[status(thm)],[c_0_11,c_0_15]) ).
cnf(c_0_17,axiom,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
product_right_cancellation ).
cnf(c_0_18,negated_conjecture,
product(e_2,e_2,e_2),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_19,plain,
( product(X1,e_1,e_2)
| product(X1,e_1,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_20,axiom,
~ equalish(e_1,e_2),
e_1_is_not_e_2 ).
cnf(c_0_21,negated_conjecture,
( equalish(X1,e_2)
| ~ product(e_2,X1,e_2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( product(e_1,e_1,e_1)
| product(e_1,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_19,c_0_10]) ).
cnf(c_0_23,axiom,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
product_left_cancellation ).
cnf(c_0_24,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_19,c_0_8]) ).
cnf(c_0_25,negated_conjecture,
~ product(e_2,e_1,e_2),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( product(e_1,e_1,e_2)
| product(e_1,e_1,X1)
| ~ product(e_1,X1,e_1) ),
inference(spm,[status(thm)],[c_0_11,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( equalish(X1,e_2)
| ~ product(X1,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_23,c_0_18]) ).
cnf(c_0_28,plain,
product(e_2,e_1,e_1),
inference(sr,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( product(e_1,e_2,e_2)
| product(e_1,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_26,c_0_12]) ).
cnf(c_0_30,negated_conjecture,
~ product(e_1,e_2,e_2),
inference(spm,[status(thm)],[c_0_20,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( product(e_1,e_1,X1)
| ~ product(e_1,X1,e_2) ),
inference(spm,[status(thm)],[c_0_11,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
product(e_1,e_1,e_2),
inference(sr,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
( equalish(X1,e_2)
| ~ product(X1,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_34,negated_conjecture,
product(e_1,e_1,e_1),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_33]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : GRP135-1.002 : TPTP v8.1.2. Released v1.2.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n023.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:53:07 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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.0vdUN7yBmJ/E---3.1_9182.p
% 0.20/0.50 # Version: 3.1pre001
% 0.20/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # new_bool_1 with pid 9261 completed with status 0
% 0.20/0.50 # Result found by new_bool_1
% 0.20/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50 # SAT001_MinMin_p005000_rr_RG with pid 9266 completed with status 0
% 0.20/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Unsatisfiable
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 9
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 9
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 9
% 0.20/0.50 # Processed clauses : 65
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 7
% 0.20/0.50 # ...remaining for further processing : 58
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 1
% 0.20/0.50 # Backward-rewritten : 16
% 0.20/0.50 # Generated clauses : 88
% 0.20/0.50 # ...of the previous two non-redundant : 83
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 85
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Total rewrite steps : 18
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 29
% 0.20/0.50 # Positive orientable unit clauses : 7
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 5
% 0.20/0.50 # Non-unit-clauses : 17
% 0.20/0.50 # Current number of unprocessed clauses: 34
% 0.20/0.50 # ...number of literals in the above : 88
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 29
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 127
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 98
% 0.20/0.50 # Non-unit clause-clause subsumptions : 6
% 0.20/0.50 # Unit Clause-clause subsumption calls : 27
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 11
% 0.20/0.50 # BW rewrite match successes : 2
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 1234
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.006 s
% 0.20/0.50 # System time : 0.000 s
% 0.20/0.50 # Total time : 0.006 s
% 0.20/0.50 # Maximum resident set size: 1636 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.007 s
% 0.20/0.50 # System time : 0.002 s
% 0.20/0.50 # Total time : 0.009 s
% 0.20/0.50 # Maximum resident set size: 1676 pages
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------