TSTP Solution File: GRP519-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP519-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:01 EDT 2023
% Result : Unsatisfiable 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of clauses : 11 ( 11 unt; 0 nHn; 3 RR)
% Number of literals : 11 ( 10 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X1,multiply(multiply(inverse(multiply(X1,X2)),X3),X2)) = X3,
file('/export/starexec/sandbox2/tmp/tmp.ZvhJUfThIT/E---3.1_27766.p',single_axiom) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/tmp/tmp.ZvhJUfThIT/E---3.1_27766.p',prove_these_axioms_3) ).
cnf(c_0_2,axiom,
multiply(X1,multiply(multiply(inverse(multiply(X1,X2)),X3),X2)) = X3,
single_axiom ).
cnf(c_0_3,plain,
multiply(multiply(inverse(multiply(inverse(multiply(X1,X2)),X3)),X4),X3) = multiply(X1,multiply(X4,X2)),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,multiply(X3,X2))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
multiply(inverse(multiply(inverse(multiply(X1,X2)),multiply(X3,X2))),X3) = X1,
inference(spm,[status(thm)],[c_0_4,c_0_4]) ).
cnf(c_0_6,plain,
multiply(inverse(X1),multiply(inverse(multiply(inverse(multiply(X2,X3)),X3)),X1)) = X2,
inference(spm,[status(thm)],[c_0_5,c_0_2]) ).
cnf(c_0_7,plain,
inverse(multiply(inverse(multiply(X1,X2)),X2)) = X1,
inference(spm,[status(thm)],[c_0_4,c_0_6]) ).
cnf(c_0_8,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
prove_these_axioms_3 ).
cnf(c_0_9,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
inference(spm,[status(thm)],[c_0_3,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP519-1 : TPTP v8.1.2. Released v2.6.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n005.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Oct 3 02:12:16 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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.ZvhJUfThIT/E---3.1_27766.p
% 0.21/0.52 # Version: 3.1pre001
% 0.21/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 27844 completed with status 0
% 0.21/0.52 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.21/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.52 # No SInE strategy applied
% 0.21/0.52 # Search class: FUUPF-FFSF21-MFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.21/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.52 # Starting sh5l with 136s (1) cores
% 0.21/0.52 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 27852 completed with status 0
% 0.21/0.52 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.21/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.52 # No SInE strategy applied
% 0.21/0.52 # Search class: FUUPF-FFSF21-MFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.21/0.52 # Preprocessing time : 0.001 s
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Unsatisfiable
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 2
% 0.21/0.52 # Removed by relevancy pruning/SinE : 0
% 0.21/0.52 # Initial clauses : 2
% 0.21/0.52 # Removed in clause preprocessing : 0
% 0.21/0.52 # Initial clauses in saturation : 2
% 0.21/0.52 # Processed clauses : 9
% 0.21/0.52 # ...of these trivial : 0
% 0.21/0.52 # ...subsumed : 0
% 0.21/0.52 # ...remaining for further processing : 9
% 0.21/0.52 # Other redundant clauses eliminated : 0
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 0
% 0.21/0.52 # Backward-rewritten : 4
% 0.21/0.52 # Generated clauses : 106
% 0.21/0.52 # ...of the previous two non-redundant : 92
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 0
% 0.21/0.52 # Paramodulations : 106
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 0
% 0.21/0.52 # Total rewrite steps : 18
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 5
% 0.21/0.52 # Positive orientable unit clauses : 5
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 0
% 0.21/0.52 # Non-unit-clauses : 0
% 0.21/0.52 # Current number of unprocessed clauses: 82
% 0.21/0.52 # ...number of literals in the above : 82
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 4
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.52 # Non-unit clause-clause subsumptions : 0
% 0.21/0.52 # Unit Clause-clause subsumption calls : 0
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 8
% 0.21/0.52 # BW rewrite match successes : 4
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 1153
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.003 s
% 0.21/0.52 # System time : 0.002 s
% 0.21/0.52 # Total time : 0.005 s
% 0.21/0.52 # Maximum resident set size: 1504 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.021 s
% 0.21/0.52 # System time : 0.006 s
% 0.21/0.52 # Total time : 0.027 s
% 0.21/0.52 # Maximum resident set size: 1668 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------