TSTP Solution File: GRP451-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP451-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:48:36 EDT 2023
% Result : Unsatisfiable 136.36s 136.53s
% Output : CNFRefutation 136.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 3 RR)
% Number of literals : 24 ( 23 equ; 2 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 : 46 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(divide(X1,X1),divide(X1,divide(X2,divide(divide(divide(X1,X1),X1),X3)))),X3) = X2,
file('/export/starexec/sandbox2/tmp/tmp.5jwslPZZTl/E---3.1_5882.p',single_axiom) ).
cnf(inverse,axiom,
inverse(X1) = divide(divide(X2,X2),X1),
file('/export/starexec/sandbox2/tmp/tmp.5jwslPZZTl/E---3.1_5882.p',inverse) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
file('/export/starexec/sandbox2/tmp/tmp.5jwslPZZTl/E---3.1_5882.p',multiply) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/tmp/tmp.5jwslPZZTl/E---3.1_5882.p',prove_these_axioms_1) ).
cnf(c_0_4,axiom,
divide(divide(divide(X1,X1),divide(X1,divide(X2,divide(divide(divide(X1,X1),X1),X3)))),X3) = X2,
single_axiom ).
cnf(c_0_5,axiom,
inverse(X1) = divide(divide(X2,X2),X1),
inverse ).
cnf(c_0_6,axiom,
multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
multiply ).
cnf(c_0_7,plain,
divide(inverse(divide(X1,divide(X2,divide(inverse(X1),X3)))),X3) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5]),c_0_5]) ).
cnf(c_0_8,plain,
divide(inverse(divide(X1,X1)),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_9,plain,
divide(X1,inverse(X2)) = multiply(X1,X2),
inference(rw,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_10,plain,
divide(inverse(inverse(multiply(X1,X2))),X2) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_5]) ).
cnf(c_0_11,plain,
multiply(inverse(inverse(multiply(X1,inverse(X2)))),X2) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
multiply(divide(X1,X1),X2) = inverse(inverse(X2)),
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_13,plain,
inverse(inverse(multiply(X1,inverse(inverse(X2))))) = multiply(inverse(inverse(X1)),X2),
inference(spm,[status(thm)],[c_0_11,c_0_11]) ).
cnf(c_0_14,plain,
multiply(multiply(inverse(X1),X1),X2) = inverse(inverse(X2)),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_15,plain,
multiply(multiply(inverse(inverse(X1)),X2),inverse(X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_13]),c_0_9]) ).
cnf(c_0_16,plain,
inverse(inverse(inverse(inverse(X1)))) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
multiply(multiply(X1,X2),inverse(X2)) = inverse(inverse(X1)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,plain,
multiply(X1,inverse(inverse(inverse(X2)))) = divide(X1,X2),
inference(spm,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_19,plain,
multiply(divide(X1,X2),X2) = inverse(inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_16]) ).
cnf(c_0_20,plain,
divide(inverse(inverse(divide(X1,X1))),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_21,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
prove_these_axioms_1 ).
cnf(c_0_22,plain,
multiply(inverse(X1),X1) = divide(X2,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_16]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : GRP451-1 : TPTP v8.1.2. Released v2.6.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n027.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Oct 3 03:03:16 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.22/0.51 Running first-order model finding
% 0.22/0.51 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.5jwslPZZTl/E---3.1_5882.p
% 136.36/136.53 # Version: 3.1pre001
% 136.36/136.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 136.36/136.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 136.36/136.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 136.36/136.53 # Starting new_bool_3 with 300s (1) cores
% 136.36/136.53 # Starting new_bool_1 with 300s (1) cores
% 136.36/136.53 # Starting sh5l with 300s (1) cores
% 136.36/136.53 # sh5l with pid 5962 completed with status 0
% 136.36/136.53 # Result found by sh5l
% 136.36/136.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 136.36/136.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 136.36/136.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 136.36/136.53 # Starting new_bool_3 with 300s (1) cores
% 136.36/136.53 # Starting new_bool_1 with 300s (1) cores
% 136.36/136.53 # Starting sh5l with 300s (1) cores
% 136.36/136.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 136.36/136.53 # Search class: FUUPS-FFSF21-DFFFFFNN
% 136.36/136.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 136.36/136.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 136.36/136.53 # SAT001_MinMin_p005000_rr_RG with pid 5966 completed with status 0
% 136.36/136.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 136.36/136.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 136.36/136.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 136.36/136.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 136.36/136.53 # Starting new_bool_3 with 300s (1) cores
% 136.36/136.53 # Starting new_bool_1 with 300s (1) cores
% 136.36/136.53 # Starting sh5l with 300s (1) cores
% 136.36/136.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 136.36/136.53 # Search class: FUUPS-FFSF21-DFFFFFNN
% 136.36/136.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 136.36/136.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 136.36/136.53 # Preprocessing time : 0.001 s
% 136.36/136.53 # Presaturation interreduction done
% 136.36/136.53
% 136.36/136.53 # Proof found!
% 136.36/136.53 # SZS status Unsatisfiable
% 136.36/136.53 # SZS output start CNFRefutation
% See solution above
% 136.36/136.53 # Parsed axioms : 4
% 136.36/136.53 # Removed by relevancy pruning/SinE : 0
% 136.36/136.53 # Initial clauses : 4
% 136.36/136.53 # Removed in clause preprocessing : 0
% 136.36/136.53 # Initial clauses in saturation : 4
% 136.36/136.53 # Processed clauses : 33
% 136.36/136.53 # ...of these trivial : 5
% 136.36/136.53 # ...subsumed : 0
% 136.36/136.53 # ...remaining for further processing : 28
% 136.36/136.53 # Other redundant clauses eliminated : 0
% 136.36/136.53 # Clauses deleted for lack of memory : 0
% 136.36/136.53 # Backward-subsumed : 0
% 136.36/136.53 # Backward-rewritten : 6
% 136.36/136.53 # Generated clauses : 231
% 136.36/136.53 # ...of the previous two non-redundant : 160
% 136.36/136.53 # ...aggressively subsumed : 0
% 136.36/136.53 # Contextual simplify-reflections : 0
% 136.36/136.53 # Paramodulations : 231
% 136.36/136.53 # Factorizations : 0
% 136.36/136.53 # NegExts : 0
% 136.36/136.53 # Equation resolutions : 0
% 136.36/136.53 # Total rewrite steps : 123
% 136.36/136.53 # Propositional unsat checks : 0
% 136.36/136.53 # Propositional check models : 0
% 136.36/136.53 # Propositional check unsatisfiable : 0
% 136.36/136.53 # Propositional clauses : 0
% 136.36/136.53 # Propositional clauses after purity: 0
% 136.36/136.53 # Propositional unsat core size : 0
% 136.36/136.53 # Propositional preprocessing time : 0.000
% 136.36/136.53 # Propositional encoding time : 0.000
% 136.36/136.53 # Propositional solver time : 0.000
% 136.36/136.53 # Success case prop preproc time : 0.000
% 136.36/136.53 # Success case prop encoding time : 0.000
% 136.36/136.53 # Success case prop solver time : 0.000
% 136.36/136.53 # Current number of processed clauses : 18
% 136.36/136.53 # Positive orientable unit clauses : 17
% 136.36/136.53 # Positive unorientable unit clauses: 1
% 136.36/136.53 # Negative unit clauses : 0
% 136.36/136.53 # Non-unit-clauses : 0
% 136.36/136.53 # Current number of unprocessed clauses: 133
% 136.36/136.53 # ...number of literals in the above : 133
% 136.36/136.53 # Current number of archived formulas : 0
% 136.36/136.53 # Current number of archived clauses : 10
% 136.36/136.53 # Clause-clause subsumption calls (NU) : 0
% 136.36/136.53 # Rec. Clause-clause subsumption calls : 0
% 136.36/136.53 # Non-unit clause-clause subsumptions : 0
% 136.36/136.53 # Unit Clause-clause subsumption calls : 7
% 136.36/136.53 # Rewrite failures with RHS unbound : 0
% 136.36/136.53 # BW rewrite match attempts : 32
% 136.36/136.53 # BW rewrite match successes : 8
% 136.36/136.53 # Condensation attempts : 0
% 136.36/136.53 # Condensation successes : 0
% 136.36/136.53 # Termbank termtop insertions : 2445
% 136.36/136.53
% 136.36/136.53 # -------------------------------------------------
% 136.36/136.53 # User time : 0.004 s
% 136.36/136.53 # System time : 0.001 s
% 136.36/136.53 # Total time : 0.005 s
% 136.36/136.53 # Maximum resident set size: 1424 pages
% 136.36/136.53
% 136.36/136.53 # -------------------------------------------------
% 136.36/136.53 # User time : 0.004 s
% 136.36/136.53 # System time : 0.004 s
% 136.36/136.53 # Total time : 0.008 s
% 136.36/136.53 # Maximum resident set size: 1672 pages
% 136.36/136.53 % E---3.1 exiting
%------------------------------------------------------------------------------