TSTP Solution File: GRP586-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP586-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:49:32 EDT 2023
% Result : Unsatisfiable 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 4 RR)
% Number of literals : 21 ( 20 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(X1,inverse(double_divide(inverse(double_divide(double_divide(X1,X2),inverse(X3))),X2))) = X3,
file('/export/starexec/sandbox/tmp/tmp.eWGLvHKv08/E---3.1_14982.p',single_axiom) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/tmp/tmp.eWGLvHKv08/E---3.1_14982.p',prove_these_axioms_2) ).
cnf(multiply,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
file('/export/starexec/sandbox/tmp/tmp.eWGLvHKv08/E---3.1_14982.p',multiply) ).
cnf(c_0_3,axiom,
double_divide(X1,inverse(double_divide(inverse(double_divide(double_divide(X1,X2),inverse(X3))),X2))) = X3,
single_axiom ).
cnf(c_0_4,plain,
double_divide(inverse(double_divide(double_divide(double_divide(X1,X2),X3),inverse(X4))),X3) = double_divide(X1,inverse(double_divide(inverse(X4),X2))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
double_divide(double_divide(X1,X2),inverse(double_divide(X1,inverse(double_divide(inverse(X3),X2))))) = X3,
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
double_divide(double_divide(double_divide(inverse(X1),X2),inverse(double_divide(inverse(X3),X2))),inverse(X3)) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_7,plain,
double_divide(X1,inverse(double_divide(double_divide(double_divide(inverse(X2),X3),X3),inverse(X1)))) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_3]) ).
cnf(c_0_8,plain,
double_divide(double_divide(double_divide(inverse(X1),X2),X2),inverse(double_divide(X3,X4))) = double_divide(X3,inverse(double_divide(inverse(X1),X4))),
inference(spm,[status(thm)],[c_0_3,c_0_7]) ).
cnf(c_0_9,plain,
double_divide(inverse(X1),inverse(double_divide(inverse(X2),inverse(double_divide(double_divide(inverse(X1),X3),X3))))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_8]) ).
cnf(c_0_10,plain,
double_divide(double_divide(inverse(X1),inverse(double_divide(double_divide(inverse(X1),X2),X2))),inverse(X3)) = X3,
inference(spm,[status(thm)],[c_0_3,c_0_9]) ).
cnf(c_0_11,plain,
double_divide(X1,inverse(double_divide(inverse(X2),inverse(X1)))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_10]),c_0_10]) ).
cnf(c_0_12,plain,
double_divide(double_divide(X1,inverse(X1)),inverse(X2)) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_11]) ).
cnf(c_0_13,plain,
double_divide(inverse(X1),inverse(double_divide(X2,inverse(X2)))) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
prove_these_axioms_2 ).
cnf(c_0_15,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
multiply ).
cnf(c_0_16,plain,
double_divide(double_divide(X1,inverse(X2)),inverse(X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_13]),c_0_13]) ).
cnf(c_0_17,plain,
double_divide(inverse(double_divide(X1,inverse(X2))),inverse(X1)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_10]),c_0_10]) ).
cnf(c_0_18,negated_conjecture,
inverse(double_divide(a2,inverse(double_divide(b2,inverse(b2))))) != a2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]) ).
cnf(c_0_19,plain,
inverse(double_divide(X1,inverse(X2))) = double_divide(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP586-1 : TPTP v8.1.2. Released v2.6.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n012.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 2400
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Oct 3 02:35:20 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.19/0.46 Running first-order model finding
% 0.19/0.46 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.eWGLvHKv08/E---3.1_14982.p
% 0.19/0.48 # Version: 3.1pre001
% 0.19/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # new_bool_3 with pid 15075 completed with status 0
% 0.19/0.48 # Result found by new_bool_3
% 0.19/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FUUPS-FFSF21-DFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.48 # SAT001_MinMin_p005000_rr_RG with pid 15078 completed with status 0
% 0.19/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FUUPS-FFSF21-DFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Unsatisfiable
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 3
% 0.19/0.48 # Removed by relevancy pruning/SinE : 0
% 0.19/0.48 # Initial clauses : 3
% 0.19/0.48 # Removed in clause preprocessing : 0
% 0.19/0.48 # Initial clauses in saturation : 3
% 0.19/0.48 # Processed clauses : 23
% 0.19/0.48 # ...of these trivial : 2
% 0.19/0.48 # ...subsumed : 0
% 0.19/0.48 # ...remaining for further processing : 21
% 0.19/0.48 # Other redundant clauses eliminated : 0
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 0
% 0.19/0.48 # Backward-rewritten : 10
% 0.19/0.48 # Generated clauses : 302
% 0.19/0.48 # ...of the previous two non-redundant : 244
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 0
% 0.19/0.48 # Paramodulations : 302
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 0
% 0.19/0.48 # Total rewrite steps : 113
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 8
% 0.19/0.48 # Positive orientable unit clauses : 8
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 0
% 0.19/0.48 # Non-unit-clauses : 0
% 0.19/0.48 # Current number of unprocessed clauses: 220
% 0.19/0.48 # ...number of literals in the above : 220
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 13
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.48 # Non-unit clause-clause subsumptions : 0
% 0.19/0.48 # Unit Clause-clause subsumption calls : 0
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 46
% 0.19/0.48 # BW rewrite match successes : 11
% 0.19/0.48 # Condensation attempts : 0
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 3995
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.006 s
% 0.19/0.48 # System time : 0.002 s
% 0.19/0.48 # Total time : 0.008 s
% 0.19/0.48 # Maximum resident set size: 1424 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.008 s
% 0.19/0.48 # System time : 0.004 s
% 0.19/0.48 # Total time : 0.011 s
% 0.19/0.48 # Maximum resident set size: 1668 pages
% 0.19/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------