TSTP Solution File: GRP453-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP453-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:00:09 EDT 2024
% Result : Unsatisfiable 0.22s 0.52s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 4
% Syntax : Number of clauses : 38 ( 38 unt; 0 nHn; 4 RR)
% Number of literals : 38 ( 37 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 74 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(inverse,axiom,
inverse(X1) = divide(divide(X2,X2),X1),
file('/export/starexec/sandbox/tmp/tmp.nP3jtF0Bke/E---3.1_20909.p',inverse) ).
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/sandbox/tmp/tmp.nP3jtF0Bke/E---3.1_20909.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
file('/export/starexec/sandbox/tmp/tmp.nP3jtF0Bke/E---3.1_20909.p',multiply) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/tmp/tmp.nP3jtF0Bke/E---3.1_20909.p',prove_these_axioms_3) ).
cnf(c_0_4,axiom,
inverse(X1) = divide(divide(X2,X2),X1),
inverse ).
cnf(c_0_5,axiom,
divide(divide(divide(X1,X1),divide(X1,divide(X2,divide(divide(divide(X1,X1),X1),X3)))),X3) = X2,
single_axiom ).
cnf(c_0_6,plain,
divide(divide(divide(a3,a3),divide(X1,X1)),X2) = divide(divide(a3,a3),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_4]),c_0_4]),c_0_4]) ).
cnf(c_0_7,axiom,
multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
multiply ).
cnf(c_0_8,plain,
divide(divide(X1,X1),X2) = divide(divide(X3,X3),X2),
inference(spm,[status(thm)],[c_0_4,c_0_4]) ).
cnf(c_0_9,plain,
divide(multiply(divide(a3,a3),multiply(X1,X2)),X2) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_6]),c_0_6]),c_0_7]),c_0_7]) ).
cnf(c_0_10,plain,
multiply(divide(X1,X1),X2) = multiply(divide(X3,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_7]) ).
cnf(c_0_11,plain,
multiply(divide(divide(a3,a3),divide(X1,X1)),X2) = multiply(divide(a3,a3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_6]),c_0_7]) ).
cnf(c_0_12,plain,
divide(divide(X1,X1),divide(X1,divide(X2,divide(divide(divide(X1,X1),X1),divide(divide(divide(X3,X3),X3),X4))))) = divide(divide(divide(X3,X3),divide(X3,X2)),X4),
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_13,plain,
divide(X1,X1) = divide(X2,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_9]) ).
cnf(c_0_14,plain,
divide(divide(a3,a3),divide(X1,X1)) = divide(a3,a3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_11]),c_0_9]) ).
cnf(c_0_15,plain,
divide(divide(X1,X1),divide(X1,divide(X2,X2))) = divide(divide(X1,X1),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_5]) ).
cnf(c_0_16,plain,
divide(divide(X1,X1),divide(X2,X2)) = divide(a3,a3),
inference(spm,[status(thm)],[c_0_14,c_0_8]) ).
cnf(c_0_17,plain,
divide(multiply(divide(X1,X1),multiply(X2,X3)),X3) = X2,
inference(spm,[status(thm)],[c_0_9,c_0_13]) ).
cnf(c_0_18,plain,
divide(multiply(divide(a3,a3),X1),divide(a3,a3)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_15]),c_0_16]),c_0_7]),c_0_16]),c_0_16]) ).
cnf(c_0_19,plain,
multiply(X1,divide(X2,X2)) = divide(X1,divide(a3,a3)),
inference(spm,[status(thm)],[c_0_7,c_0_14]) ).
cnf(c_0_20,plain,
divide(X1,divide(a3,a3)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_21,plain,
multiply(divide(divide(X1,X1),divide(X1,divide(X2,multiply(divide(divide(X1,X1),X1),X3)))),X3) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_5]),c_0_7]) ).
cnf(c_0_22,plain,
multiply(X1,divide(X2,X2)) = X1,
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
divide(divide(X1,X1),divide(X1,multiply(X2,X1))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_19]),c_0_20]),c_0_7]) ).
cnf(c_0_24,plain,
multiply(multiply(divide(a3,a3),divide(X1,multiply(divide(a3,a3),X2))),X2) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_16]),c_0_16]),c_0_7]) ).
cnf(c_0_25,plain,
multiply(divide(a3,a3),X1) = X1,
inference(rw,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_26,plain,
divide(divide(a3,a3),divide(X1,multiply(X2,X1))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_23]),c_0_4]) ).
cnf(c_0_27,plain,
multiply(divide(X1,X2),X2) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_25]) ).
cnf(c_0_28,plain,
divide(divide(a3,a3),divide(X1,X2)) = divide(X2,X1),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,plain,
divide(multiply(X1,X2),X2) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_25]) ).
cnf(c_0_30,plain,
divide(X1,multiply(X2,X1)) = divide(divide(a3,a3),X2),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,plain,
multiply(divide(divide(a3,a3),X1),multiply(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_27,c_0_30]) ).
cnf(c_0_32,plain,
multiply(divide(divide(X1,X2),a3),multiply(a3,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_31]),c_0_28]) ).
cnf(c_0_33,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(fof_simplification,[status(thm)],[prove_these_axioms_3]) ).
cnf(c_0_34,plain,
multiply(divide(a3,divide(X1,X2)),X1) = multiply(a3,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_28]) ).
cnf(c_0_35,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
c_0_33 ).
cnf(c_0_36,plain,
multiply(multiply(a3,X1),X2) = multiply(a3,multiply(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_30]),c_0_7]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP453-1 : TPTP v8.1.2. Released v2.6.0.
% 0.14/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n007.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 : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 15:50:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.22/0.48 Running first-order model finding
% 0.22/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.nP3jtF0Bke/E---3.1_20909.p
% 0.22/0.52 # Version: 3.1.0
% 0.22/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 # Starting sh5l with 300s (1) cores
% 0.22/0.52 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 20998 completed with status 0
% 0.22/0.52 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.22/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.52 # No SInE strategy applied
% 0.22/0.52 # Search class: FUUPS-FFSF21-DFFFFFNN
% 0.22/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.22/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.22/0.52 # Starting sh5l with 136s (1) cores
% 0.22/0.52 # SAT001_MinMin_p005000_rr_RG with pid 21007 completed with status 0
% 0.22/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.52 # No SInE strategy applied
% 0.22/0.52 # Search class: FUUPS-FFSF21-DFFFFFNN
% 0.22/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.52 # Preprocessing time : 0.001 s
% 0.22/0.52 # Presaturation interreduction done
% 0.22/0.52
% 0.22/0.52 # Proof found!
% 0.22/0.52 # SZS status Unsatisfiable
% 0.22/0.52 # SZS output start CNFRefutation
% See solution above
% 0.22/0.52 # Parsed axioms : 4
% 0.22/0.52 # Removed by relevancy pruning/SinE : 0
% 0.22/0.52 # Initial clauses : 4
% 0.22/0.52 # Removed in clause preprocessing : 0
% 0.22/0.52 # Initial clauses in saturation : 4
% 0.22/0.52 # Processed clauses : 146
% 0.22/0.52 # ...of these trivial : 33
% 0.22/0.52 # ...subsumed : 63
% 0.22/0.52 # ...remaining for further processing : 50
% 0.22/0.52 # Other redundant clauses eliminated : 0
% 0.22/0.52 # Clauses deleted for lack of memory : 0
% 0.22/0.52 # Backward-subsumed : 2
% 0.22/0.52 # Backward-rewritten : 27
% 0.22/0.52 # Generated clauses : 1014
% 0.22/0.52 # ...of the previous two non-redundant : 724
% 0.22/0.52 # ...aggressively subsumed : 0
% 0.22/0.52 # Contextual simplify-reflections : 0
% 0.22/0.52 # Paramodulations : 1014
% 0.22/0.52 # Factorizations : 0
% 0.22/0.52 # NegExts : 0
% 0.22/0.52 # Equation resolutions : 0
% 0.22/0.52 # Disequality decompositions : 0
% 0.22/0.52 # Total rewrite steps : 1535
% 0.22/0.52 # ...of those cached : 1110
% 0.22/0.52 # Propositional unsat checks : 0
% 0.22/0.52 # Propositional check models : 0
% 0.22/0.52 # Propositional check unsatisfiable : 0
% 0.22/0.52 # Propositional clauses : 0
% 0.22/0.52 # Propositional clauses after purity: 0
% 0.22/0.52 # Propositional unsat core size : 0
% 0.22/0.52 # Propositional preprocessing time : 0.000
% 0.22/0.52 # Propositional encoding time : 0.000
% 0.22/0.52 # Propositional solver time : 0.000
% 0.22/0.52 # Success case prop preproc time : 0.000
% 0.22/0.52 # Success case prop encoding time : 0.000
% 0.22/0.52 # Success case prop solver time : 0.000
% 0.22/0.52 # Current number of processed clauses : 17
% 0.22/0.52 # Positive orientable unit clauses : 15
% 0.22/0.52 # Positive unorientable unit clauses: 2
% 0.22/0.52 # Negative unit clauses : 0
% 0.22/0.52 # Non-unit-clauses : 0
% 0.22/0.52 # Current number of unprocessed clauses: 498
% 0.22/0.52 # ...number of literals in the above : 498
% 0.22/0.52 # Current number of archived formulas : 0
% 0.22/0.52 # Current number of archived clauses : 33
% 0.22/0.52 # Clause-clause subsumption calls (NU) : 0
% 0.22/0.52 # Rec. Clause-clause subsumption calls : 0
% 0.22/0.52 # Non-unit clause-clause subsumptions : 0
% 0.22/0.52 # Unit Clause-clause subsumption calls : 18
% 0.22/0.52 # Rewrite failures with RHS unbound : 0
% 0.22/0.52 # BW rewrite match attempts : 118
% 0.22/0.52 # BW rewrite match successes : 52
% 0.22/0.52 # Condensation attempts : 0
% 0.22/0.52 # Condensation successes : 0
% 0.22/0.52 # Termbank termtop insertions : 11340
% 0.22/0.52 # Search garbage collected termcells : 2
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.016 s
% 0.22/0.52 # System time : 0.003 s
% 0.22/0.52 # Total time : 0.020 s
% 0.22/0.52 # Maximum resident set size: 1552 pages
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.090 s
% 0.22/0.52 # System time : 0.011 s
% 0.22/0.52 # Total time : 0.101 s
% 0.22/0.52 # Maximum resident set size: 1688 pages
% 0.22/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------