TSTP Solution File: SYO691-1.000 by JavaRes---1.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : JavaRes---1.3.0
% Problem : SYO691-1.000 : TPTP v7.5.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xmx15G -cp /export/starexec/sandbox/solver/bin atp.ProverFOF -i /export/starexec/sandbox/benchmark --eqax --proof --forward-subsumption --backward_subsumption --delete-tautologies --timeout 0 %s
% Computer : n004.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 : 600s
% DateTime : Tue Mar 29 03:34:00 EDT 2022
% Result : Unsatisfiable 0.89s 0.64s
% Output : CNFRefutation 0.89s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named input)
% Comments :
%------------------------------------------------------------------------------
cnf(prove,negated_conjecture,
~ seq(succ(succ(succ(zero))),X4,X4),
input ).
cnf(rewrite_left,axiom,
( ~ step(X5,X6)
| step(f(X5,X7),f(X6,X7)) ),
input ).
cnf(rewrite_left_001,axiom,
( ~ step(X5,X6)
| step(f(X5,X7),f(X6,X7)) ),
input ).
cnf(rewrite_top,axiom,
( ~ top(X2,X3)
| step(X2,X3) ),
input ).
cnf(rule_1,axiom,
top(f(f(X11,X12),f(X13,a)),f(f(X13,f(X12,a)),X11)),
input ).
cnf(c0,plain,
step(f(f(X20,X21),f(X22,a)),f(f(X22,f(X21,a)),X20)),
inference(resolution,status(thm),[rule_1,rewrite_top]) ).
cnf(c4,plain,
step(f(f(f(X30,X31),f(X32,a)),X33),f(f(f(X32,f(X31,a)),X30),X33)),
inference(resolution,status(thm),[c0,rewrite_left]) ).
cnf(c11,plain,
step(f(f(f(f(X61,X62),f(X63,a)),X64),X65),f(f(f(f(X63,f(X62,a)),X61),X64),X65)),
inference(resolution,status(thm),[c4,rewrite_left]) ).
cnf(rewrite_sequence_succ,axiom,
( ~ seq(X14,X15,X16)
| ~ step(X16,X17)
| seq(succ(X14),X15,X17) ),
input ).
cnf(rewrite_left_002,axiom,
( ~ step(X5,X6)
| step(f(X5,X7),f(X6,X7)) ),
input ).
cnf(rewrite_top_003,axiom,
( ~ top(X2,X3)
| step(X2,X3) ),
input ).
cnf(rule_1_004,axiom,
top(f(f(X11,X12),f(X13,a)),f(f(X13,f(X12,a)),X11)),
input ).
cnf(c0_005,plain,
step(f(f(X20,X21),f(X22,a)),f(f(X22,f(X21,a)),X20)),
inference(resolution,status(thm),[rule_1,rewrite_top]) ).
cnf(c4_006,plain,
step(f(f(f(X30,X31),f(X32,a)),X33),f(f(f(X32,f(X31,a)),X30),X33)),
inference(resolution,status(thm),[c0,rewrite_left]) ).
cnf(rewrite_sequence_succ_007,axiom,
( ~ seq(X14,X15,X16)
| ~ step(X16,X17)
| seq(succ(X14),X15,X17) ),
input ).
cnf(rewrite_sequence_zero,axiom,
seq(zero,X1,X1),
input ).
cnf(rewrite_sequence_succ_008,axiom,
( ~ seq(X14,X15,X16)
| ~ step(X16,X17)
| seq(succ(X14),X15,X17) ),
input ).
cnf(c1,plain,
( ~ step(X18,X19)
| seq(succ(zero),X18,X19) ),
inference(resolution,status(thm),[rewrite_sequence_succ,rewrite_sequence_zero]) ).
cnf(rewrite_top_009,axiom,
( ~ top(X2,X3)
| step(X2,X3) ),
input ).
cnf(rule_1_010,axiom,
top(f(f(X11,X12),f(X13,a)),f(f(X13,f(X12,a)),X11)),
input ).
cnf(c0_011,plain,
step(f(f(X20,X21),f(X22,a)),f(f(X22,f(X21,a)),X20)),
inference(resolution,status(thm),[rule_1,rewrite_top]) ).
cnf(c3,plain,
seq(succ(zero),f(f(X23,X24),f(X25,a)),f(f(X25,f(X24,a)),X23)),
inference(resolution,status(thm),[c0,c1]) ).
cnf(c5,plain,
( ~ step(f(f(X34,f(X35,a)),X36),X37)
| seq(succ(succ(zero)),f(f(X36,X35),f(X34,a)),X37) ),
inference(resolution,status(thm),[c3,rewrite_sequence_succ]) ).
cnf(c12,plain,
seq(succ(succ(zero)),f(f(X66,X67),f(f(X68,X69),a)),f(f(f(X67,f(X69,a)),X68),X66)),
inference(resolution,status(thm),[c5,c4]) ).
cnf(c32,plain,
( ~ step(f(f(f(X168,f(X169,a)),X170),X171),X172)
| seq(succ(succ(succ(zero))),f(f(X171,X168),f(f(X170,X169),a)),X172) ),
inference(resolution,status(thm),[c12,rewrite_sequence_succ]) ).
cnf(c107,plain,
seq(succ(succ(succ(zero))),f(f(X215,f(X216,X217)),f(f(X218,X219),a)),f(f(f(f(X219,f(X217,a)),X216),X218),X215)),
inference(resolution,status(thm),[c32,c11]) ).
cnf(c135,plain,
$false,
inference(resolution,status(thm),[c107,prove]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO691-1.000 : TPTP v7.5.0. Released v7.3.0.
% 0.03/0.13 % Command : java -Xmx15G -cp /export/starexec/sandbox/solver/bin atp.ProverFOF -i /export/starexec/sandbox/benchmark --eqax --proof --forward-subsumption --backward_subsumption --delete-tautologies --timeout 0 %s
% 0.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % RAMPerCPU : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Mar 14 20:44:10 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.47 # Using default include path : /export/starexec/sandbox/benchmark
% 0.19/0.47 # INFO in ProverFOF.main(): Processing file /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 # ProverFOF.processTestFile(): filename: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 # ProverFOF.processTestFile(): opts: {backward_subsumption=true, delete-tautologies=true, filename=/export/starexec/sandbox/benchmark/theBenchmark.p, forward-subsumption=true, proof=true, eqax=true, timeout=0}
% 0.19/0.47 # ProverFOF.processTestFile(): evals: [Heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval] litSelect: LARGEST indexing: true delTaut: true forSub: true backSub: true]
% 0.19/0.50 # hasConjecture: true isFOF: false
% 0.19/0.50 # ProofState(): heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.19/0.50 # HeuristicsClauseSet using eval functions: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.89/0.64 # -----------------
% 0.89/0.64 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.89/0.64
% 0.89/0.64 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.89/0.64 cnf(prove,negated_conjecture,~seq(succ(succ(succ(zero))),X4,X4),input).
% 0.89/0.64 cnf(rewrite_left,axiom,~step(X5,X6)|step(f(X5,X7),f(X6,X7)),input).
% 0.89/0.64 cnf(rewrite_left,axiom,~step(X5,X6)|step(f(X5,X7),f(X6,X7)),input).
% 0.89/0.64 cnf(rewrite_top,axiom,~top(X2,X3)|step(X2,X3),input).
% 0.89/0.64 cnf(rule_1,axiom,top(f(f(X11,X12),f(X13,a)),f(f(X13,f(X12,a)),X11)),input).
% 0.89/0.64 cnf(c0,plain,step(f(f(X20,X21),f(X22,a)),f(f(X22,f(X21,a)),X20)),inference(resolution, status(thm), [rule_1, rewrite_top])).
% 0.89/0.64 cnf(c4,plain,step(f(f(f(X30,X31),f(X32,a)),X33),f(f(f(X32,f(X31,a)),X30),X33)),inference(resolution, status(thm), [c0, rewrite_left])).
% 0.89/0.64 cnf(c11,plain,step(f(f(f(f(X61,X62),f(X63,a)),X64),X65),f(f(f(f(X63,f(X62,a)),X61),X64),X65)),inference(resolution, status(thm), [c4, rewrite_left])).
% 0.89/0.64 cnf(rewrite_sequence_succ,axiom,~seq(X14,X15,X16)|~step(X16,X17)|seq(succ(X14),X15,X17),input).
% 0.89/0.64 cnf(rewrite_left,axiom,~step(X5,X6)|step(f(X5,X7),f(X6,X7)),input).
% 0.89/0.64 cnf(rewrite_top,axiom,~top(X2,X3)|step(X2,X3),input).
% 0.89/0.64 cnf(rule_1,axiom,top(f(f(X11,X12),f(X13,a)),f(f(X13,f(X12,a)),X11)),input).
% 0.89/0.64 cnf(c0,plain,step(f(f(X20,X21),f(X22,a)),f(f(X22,f(X21,a)),X20)),inference(resolution, status(thm), [rule_1, rewrite_top])).
% 0.89/0.64 cnf(c4,plain,step(f(f(f(X30,X31),f(X32,a)),X33),f(f(f(X32,f(X31,a)),X30),X33)),inference(resolution, status(thm), [c0, rewrite_left])).
% 0.89/0.64 cnf(rewrite_sequence_succ,axiom,~seq(X14,X15,X16)|~step(X16,X17)|seq(succ(X14),X15,X17),input).
% 0.89/0.64 cnf(rewrite_sequence_zero,axiom,seq(zero,X1,X1),input).
% 0.89/0.64 cnf(rewrite_sequence_succ,axiom,~seq(X14,X15,X16)|~step(X16,X17)|seq(succ(X14),X15,X17),input).
% 0.89/0.64 cnf(c1,plain,~step(X18,X19)|seq(succ(zero),X18,X19),inference(resolution, status(thm), [rewrite_sequence_succ, rewrite_sequence_zero])).
% 0.89/0.64 cnf(rewrite_top,axiom,~top(X2,X3)|step(X2,X3),input).
% 0.89/0.64 cnf(rule_1,axiom,top(f(f(X11,X12),f(X13,a)),f(f(X13,f(X12,a)),X11)),input).
% 0.89/0.64 cnf(c0,plain,step(f(f(X20,X21),f(X22,a)),f(f(X22,f(X21,a)),X20)),inference(resolution, status(thm), [rule_1, rewrite_top])).
% 0.89/0.64 cnf(c3,plain,seq(succ(zero),f(f(X23,X24),f(X25,a)),f(f(X25,f(X24,a)),X23)),inference(resolution, status(thm), [c0, c1])).
% 0.89/0.64 cnf(c5,plain,~step(f(f(X34,f(X35,a)),X36),X37)|seq(succ(succ(zero)),f(f(X36,X35),f(X34,a)),X37),inference(resolution, status(thm), [c3, rewrite_sequence_succ])).
% 0.89/0.65 cnf(c12,plain,seq(succ(succ(zero)),f(f(X66,X67),f(f(X68,X69),a)),f(f(f(X67,f(X69,a)),X68),X66)),inference(resolution, status(thm), [c5, c4])).
% 0.89/0.65 cnf(c32,plain,~step(f(f(f(X168,f(X169,a)),X170),X171),X172)|seq(succ(succ(succ(zero))),f(f(X171,X168),f(f(X170,X169),a)),X172),inference(resolution, status(thm), [c12, rewrite_sequence_succ])).
% 0.89/0.65 cnf(c107,plain,seq(succ(succ(succ(zero))),f(f(X215,f(X216,X217)),f(f(X218,X219),a)),f(f(f(f(X219,f(X217,a)),X216),X218),X215)),inference(resolution, status(thm), [c32, c11])).
% 0.89/0.65 cnf(c135,plain,$false,inference(resolution, status(thm), [c107, prove])).
% 0.89/0.65 % SZS output end CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.89/0.65 # Filename : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.89/0.65 # Indexed : true
% 0.89/0.65 # Eval function name : PickGiven5
% 0.89/0.65 # Initial clauses : 7
% 0.89/0.65 # Processed clauses : 49
% 0.89/0.65 # Factors computed : 0
% 0.89/0.65 # Resolvents computed: 136
% 0.89/0.65 # Tautologies deleted: 0
% 0.89/0.65 # Forward subsumed : 0
% 0.89/0.65 # Backward subsumed : 0
% 0.89/0.65 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.89/0.65 # SZS Expected : Unsatisfiable
% 0.89/0.65 # time : 144ms
% 0.89/0.65
%------------------------------------------------------------------------------