TSTP Solution File: GRP602-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP602-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:34 EDT 2023
% Result : Unsatisfiable 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of clauses : 33 ( 33 unt; 0 nHn; 7 RR)
% Number of literals : 33 ( 32 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 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 : 70 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(double_divide(inverse(double_divide(X1,inverse(double_divide(X2,double_divide(X1,X3))))),X3)) = X2,
file('/export/starexec/sandbox/tmp/tmp.hdlUzzfKKT/E---3.1_11978.p',single_axiom) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/tmp/tmp.hdlUzzfKKT/E---3.1_11978.p',prove_these_axioms_2) ).
cnf(multiply,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
file('/export/starexec/sandbox/tmp/tmp.hdlUzzfKKT/E---3.1_11978.p',multiply) ).
cnf(c_0_3,axiom,
inverse(double_divide(inverse(double_divide(X1,inverse(double_divide(X2,double_divide(X1,X3))))),X3)) = X2,
single_axiom ).
cnf(c_0_4,plain,
inverse(double_divide(X1,inverse(double_divide(X2,double_divide(X1,double_divide(X3,X4)))))) = inverse(double_divide(inverse(double_divide(X3,X2)),X4)),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
inverse(double_divide(inverse(double_divide(inverse(double_divide(X1,X2)),X3)),double_divide(X1,X3))) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
inverse(double_divide(X1,double_divide(inverse(double_divide(X2,X1)),double_divide(X2,X3)))) = X3,
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_7,plain,
inverse(double_divide(inverse(double_divide(X1,X2)),double_divide(inverse(double_divide(inverse(double_divide(X3,X1)),X4)),X2))) = double_divide(X3,X4),
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_8,plain,
double_divide(X1,inverse(double_divide(X2,double_divide(inverse(double_divide(X1,X2)),X3)))) = X3,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
double_divide(inverse(double_divide(X1,X2)),double_divide(X1,inverse(double_divide(X2,X3)))) = X3,
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_10,plain,
inverse(double_divide(inverse(X1),double_divide(X2,double_divide(X2,inverse(double_divide(X3,X1)))))) = X3,
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_11,plain,
double_divide(inverse(double_divide(X1,inverse(X2))),inverse(double_divide(X3,X2))) = double_divide(X1,X3),
inference(spm,[status(thm)],[c_0_8,c_0_10]) ).
cnf(c_0_12,plain,
double_divide(X1,inverse(double_divide(inverse(X2),double_divide(X1,X3)))) = inverse(double_divide(X3,X2)),
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_13,plain,
inverse(double_divide(X1,double_divide(inverse(double_divide(X2,X3)),X1))) = double_divide(X2,X3),
inference(spm,[status(thm)],[c_0_12,c_0_5]) ).
cnf(c_0_14,plain,
double_divide(X1,double_divide(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_13]) ).
cnf(c_0_15,plain,
inverse(double_divide(inverse(double_divide(X1,X2)),double_divide(inverse(double_divide(X3,inverse(double_divide(X1,double_divide(X3,X4))))),X2))) = X4,
inference(spm,[status(thm)],[c_0_5,c_0_3]) ).
cnf(c_0_16,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
prove_these_axioms_2 ).
cnf(c_0_17,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
multiply ).
cnf(c_0_18,plain,
double_divide(inverse(X1),inverse(X2)) = inverse(double_divide(X2,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_19,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_14]) ).
cnf(c_0_20,plain,
inverse(double_divide(inverse(inverse(double_divide(X1,X2))),X1)) = inverse(X2),
inference(spm,[status(thm)],[c_0_3,c_0_12]) ).
cnf(c_0_21,negated_conjecture,
inverse(double_divide(a2,inverse(double_divide(b2,inverse(b2))))) != a2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]) ).
cnf(c_0_22,plain,
inverse(double_divide(X1,inverse(X2))) = double_divide(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
double_divide(double_divide(X1,X2),X1) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_19]),c_0_19]) ).
cnf(c_0_24,plain,
inverse(double_divide(inverse(X1),X2)) = double_divide(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
double_divide(double_divide(b2,inverse(b2)),inverse(a2)) != a2,
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
double_divide(X1,X2) = double_divide(X2,X1),
inference(spm,[status(thm)],[c_0_23,c_0_14]) ).
cnf(c_0_27,plain,
inverse(double_divide(X1,inverse(double_divide(X2,double_divide(X1,double_divide(X3,X4)))))) = double_divide(inverse(X4),double_divide(X3,X2)),
inference(rw,[status(thm)],[c_0_4,c_0_24]) ).
cnf(c_0_28,plain,
double_divide(X1,double_divide(X2,X1)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_18]),c_0_19]),c_0_18]),c_0_19]),c_0_19]) ).
cnf(c_0_29,negated_conjecture,
double_divide(inverse(a2),double_divide(b2,inverse(b2))) != a2,
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
double_divide(X1,inverse(X1)) = double_divide(X2,inverse(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_22]),c_0_14]),c_0_26]) ).
cnf(c_0_31,negated_conjecture,
double_divide(inverse(a2),double_divide(X1,inverse(X1))) != a2,
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_14]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP602-1 : TPTP v8.1.2. Released v2.6.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n012.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Oct 3 02:34:20 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.hdlUzzfKKT/E---3.1_11978.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_3 with pid 12063 completed with status 0
% 0.20/0.50 # Result found by new_bool_3
% 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 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FUUPS-FFSF21-DFFFFFNN
% 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 12068 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 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FUUPS-FFSF21-DFFFFFNN
% 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 : 3
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 3
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 3
% 0.20/0.50 # Processed clauses : 54
% 0.20/0.50 # ...of these trivial : 8
% 0.20/0.50 # ...subsumed : 8
% 0.20/0.50 # ...remaining for further processing : 38
% 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 : 19
% 0.20/0.50 # Generated clauses : 900
% 0.20/0.50 # ...of the previous two non-redundant : 838
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 900
% 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 : 429
% 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 : 15
% 0.20/0.50 # Positive orientable unit clauses : 12
% 0.20/0.50 # Positive unorientable unit clauses: 2
% 0.20/0.50 # Negative unit clauses : 1
% 0.20/0.50 # Non-unit-clauses : 0
% 0.20/0.50 # Current number of unprocessed clauses: 752
% 0.20/0.50 # ...number of literals in the above : 752
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 23
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 18
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 129
% 0.20/0.50 # BW rewrite match successes : 56
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 9715
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.013 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.016 s
% 0.20/0.50 # Maximum resident set size: 1612 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.015 s
% 0.20/0.50 # System time : 0.004 s
% 0.20/0.50 # Total time : 0.019 s
% 0.20/0.50 # Maximum resident set size: 1672 pages
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------