TSTP Solution File: SYO629-1 by JavaRes---1.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : JavaRes---1.3.0
% Problem : SYO629-1 : TPTP v7.5.0. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xmx15G -cp /export/starexec/sandbox2/solver/bin atp.ProverFOF -i /export/starexec/sandbox2/benchmark --eqax --proof --forward-subsumption --backward_subsumption --delete-tautologies --timeout 0 %s
% Computer : n019.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:33:51 EDT 2022
% Result : Unsatisfiable 0.95s 0.63s
% Output : CNFRefutation 0.95s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named input)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_8_01,axiom,
~ 'E'(f(X6),f(g(X6))),
input ).
cnf(clause_7_05,axiom,
~ 'LE'(f(X5),'0'),
input ).
cnf(clause_0_02,axiom,
iLEQ(X1,X1),
input ).
cnf(clause_6_04,axiom,
( 'E'(s('0'),f(X9))
| 'LE'(f(X9),s('0')) ),
input ).
cnf(clause_10_06,axiom,
( ~ 'LE'(f(X11),s('0'))
| ~ iLEQ(X11,X12)
| 'E'('0',f(X12))
| 'LE'(f(X12),'0') ),
input ).
cnf(c0,plain,
( ~ iLEQ(X14,X15)
| 'E'('0',f(X15))
| 'LE'(f(X15),'0')
| 'E'(s('0'),f(X14)) ),
inference(resolution,status(thm),[clause_10_06,clause_6_04]) ).
cnf(c2,plain,
( 'E'('0',f(X16))
| 'LE'(f(X16),'0')
| 'E'(s('0'),f(X16)) ),
inference(resolution,status(thm),[c0,clause_0_02]) ).
cnf(c5,plain,
( 'E'('0',f(X17))
| 'E'(s('0'),f(X17)) ),
inference(resolution,status(thm),[c2,clause_7_05]) ).
cnf(clause_11_03,axiom,
( ~ 'E'('0',f(X10))
| ~ 'E'('0',f(g(X10)))
| 'E'(f(X10),f(g(X10))) ),
input ).
cnf(clause_7_05_001,axiom,
~ 'LE'(f(X5),'0'),
input ).
cnf(clause_3_09,axiom,
iLEQ(X3,g(X3)),
input ).
cnf(clause_6_04_002,axiom,
( 'E'(s('0'),f(X9))
| 'LE'(f(X9),s('0')) ),
input ).
cnf(clause_10_06_003,axiom,
( ~ 'LE'(f(X11),s('0'))
| ~ iLEQ(X11,X12)
| 'E'('0',f(X12))
| 'LE'(f(X12),'0') ),
input ).
cnf(c0_004,plain,
( ~ iLEQ(X14,X15)
| 'E'('0',f(X15))
| 'LE'(f(X15),'0')
| 'E'(s('0'),f(X14)) ),
inference(resolution,status(thm),[clause_10_06,clause_6_04]) ).
cnf(c3,plain,
( 'E'('0',f(g(X18)))
| 'LE'(f(g(X18)),'0')
| 'E'(s('0'),f(X18)) ),
inference(resolution,status(thm),[c0,clause_3_09]) ).
cnf(c10,plain,
( 'E'('0',f(g(X19)))
| 'E'(s('0'),f(X19)) ),
inference(resolution,status(thm),[c3,clause_7_05]) ).
cnf(c12,plain,
( 'E'(s('0'),f(X21))
| ~ 'E'('0',f(X21))
| 'E'(f(X21),f(g(X21))) ),
inference(resolution,status(thm),[c10,clause_11_03]) ).
cnf(c20,plain,
( 'E'(s('0'),f(X22))
| 'E'(f(X22),f(g(X22))) ),
inference(resolution,status(thm),[c12,c5]) ).
cnf(clause_1_07,axiom,
( ~ 'E'(s('0'),f(X13))
| ~ 'E'(s('0'),f(g(X13)))
| 'E'(f(X13),f(g(X13))) ),
input ).
cnf(clause_8_01_005,axiom,
~ 'E'(f(X6),f(g(X6))),
input ).
cnf(clause_7_05_006,axiom,
~ 'LE'(f(X5),'0'),
input ).
cnf(clause_0_02_007,axiom,
iLEQ(X1,X1),
input ).
cnf(clause_6_04_008,axiom,
( 'E'(s('0'),f(X9))
| 'LE'(f(X9),s('0')) ),
input ).
cnf(clause_10_06_009,axiom,
( ~ 'LE'(f(X11),s('0'))
| ~ iLEQ(X11,X12)
| 'E'('0',f(X12))
| 'LE'(f(X12),'0') ),
input ).
cnf(c0_010,plain,
( ~ iLEQ(X14,X15)
| 'E'('0',f(X15))
| 'LE'(f(X15),'0')
| 'E'(s('0'),f(X14)) ),
inference(resolution,status(thm),[clause_10_06,clause_6_04]) ).
cnf(c2_011,plain,
( 'E'('0',f(X16))
| 'LE'(f(X16),'0')
| 'E'(s('0'),f(X16)) ),
inference(resolution,status(thm),[c0,clause_0_02]) ).
cnf(c5_012,plain,
( 'E'('0',f(X17))
| 'E'(s('0'),f(X17)) ),
inference(resolution,status(thm),[c2,clause_7_05]) ).
cnf(clause_11_03_013,axiom,
( ~ 'E'('0',f(X10))
| ~ 'E'('0',f(g(X10)))
| 'E'(f(X10),f(g(X10))) ),
input ).
cnf(clause_7_05_014,axiom,
~ 'LE'(f(X5),'0'),
input ).
cnf(clause_3_09_015,axiom,
iLEQ(X3,g(X3)),
input ).
cnf(clause_6_04_016,axiom,
( 'E'(s('0'),f(X9))
| 'LE'(f(X9),s('0')) ),
input ).
cnf(clause_10_06_017,axiom,
( ~ 'LE'(f(X11),s('0'))
| ~ iLEQ(X11,X12)
| 'E'('0',f(X12))
| 'LE'(f(X12),'0') ),
input ).
cnf(c0_018,plain,
( ~ iLEQ(X14,X15)
| 'E'('0',f(X15))
| 'LE'(f(X15),'0')
| 'E'(s('0'),f(X14)) ),
inference(resolution,status(thm),[clause_10_06,clause_6_04]) ).
cnf(c3_019,plain,
( 'E'('0',f(g(X18)))
| 'LE'(f(g(X18)),'0')
| 'E'(s('0'),f(X18)) ),
inference(resolution,status(thm),[c0,clause_3_09]) ).
cnf(c10_020,plain,
( 'E'('0',f(g(X19)))
| 'E'(s('0'),f(X19)) ),
inference(resolution,status(thm),[c3,clause_7_05]) ).
cnf(c12_021,plain,
( 'E'(s('0'),f(X21))
| ~ 'E'('0',f(X21))
| 'E'(f(X21),f(g(X21))) ),
inference(resolution,status(thm),[c10,clause_11_03]) ).
cnf(c20_022,plain,
( 'E'(s('0'),f(X22))
| 'E'(f(X22),f(g(X22))) ),
inference(resolution,status(thm),[c12,c5]) ).
cnf(c25,plain,
'E'(s('0'),f(X23)),
inference(resolution,status(thm),[c20,clause_8_01]) ).
cnf(c26,plain,
( ~ 'E'(s('0'),f(X24))
| 'E'(f(X24),f(g(X24))) ),
inference(resolution,status(thm),[c25,clause_1_07]) ).
cnf(c29,plain,
'E'(f(X25),f(g(X25))),
inference(resolution,status(thm),[c26,c20]) ).
cnf(c35,plain,
$false,
inference(resolution,status(thm),[c29,clause_8_01]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYO629-1 : TPTP v7.5.0. Released v7.1.0.
% 0.11/0.13 % Command : java -Xmx15G -cp /export/starexec/sandbox2/solver/bin atp.ProverFOF -i /export/starexec/sandbox2/benchmark --eqax --proof --forward-subsumption --backward_subsumption --delete-tautologies --timeout 0 %s
% 0.13/0.33 % Computer : n019.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % RAMPerCPU : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Mar 14 09:54:57 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.18/0.46 # Using default include path : /export/starexec/sandbox2/benchmark
% 0.18/0.47 # INFO in ProverFOF.main(): Processing file /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.47 # ProverFOF.processTestFile(): filename: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.47 # ProverFOF.processTestFile(): opts: {backward_subsumption=true, delete-tautologies=true, filename=/export/starexec/sandbox2/benchmark/theBenchmark.p, forward-subsumption=true, proof=true, eqax=true, timeout=0}
% 0.18/0.47 # ProverFOF.processTestFile(): evals: [Heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval] litSelect: LARGEST indexing: true delTaut: true forSub: true backSub: true]
% 0.18/0.49 # hasConjecture: false isFOF: false
% 0.18/0.49 # ProofState(): heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.18/0.49 # HeuristicsClauseSet using eval functions: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.95/0.63 # -----------------
% 0.95/0.63 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.95/0.63
% 0.95/0.63 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.95/0.63 cnf(clause_8_01,axiom,~'E'(f(X6),f(g(X6))),input).
% 0.95/0.63 cnf(clause_7_05,axiom,~'LE'(f(X5),'0'),input).
% 0.95/0.63 cnf(clause_0_02,axiom,iLEQ(X1,X1),input).
% 0.95/0.63 cnf(clause_6_04,axiom,'E'(s('0'),f(X9))|'LE'(f(X9),s('0')),input).
% 0.95/0.63 cnf(clause_10_06,axiom,~'LE'(f(X11),s('0'))|~iLEQ(X11,X12)|'E'('0',f(X12))|'LE'(f(X12),'0'),input).
% 0.95/0.63 cnf(c0,plain,~iLEQ(X14,X15)|'E'('0',f(X15))|'LE'(f(X15),'0')|'E'(s('0'),f(X14)),inference(resolution, status(thm), [clause_10_06, clause_6_04])).
% 0.95/0.63 cnf(c2,plain,'E'('0',f(X16))|'LE'(f(X16),'0')|'E'(s('0'),f(X16)),inference(resolution, status(thm), [c0, clause_0_02])).
% 0.95/0.63 cnf(c5,plain,'E'('0',f(X17))|'E'(s('0'),f(X17)),inference(resolution, status(thm), [c2, clause_7_05])).
% 0.95/0.63 cnf(clause_11_03,axiom,~'E'('0',f(X10))|~'E'('0',f(g(X10)))|'E'(f(X10),f(g(X10))),input).
% 0.95/0.64 cnf(clause_7_05,axiom,~'LE'(f(X5),'0'),input).
% 0.95/0.64 cnf(clause_3_09,axiom,iLEQ(X3,g(X3)),input).
% 0.95/0.64 cnf(clause_6_04,axiom,'E'(s('0'),f(X9))|'LE'(f(X9),s('0')),input).
% 0.95/0.64 cnf(clause_10_06,axiom,~'LE'(f(X11),s('0'))|~iLEQ(X11,X12)|'E'('0',f(X12))|'LE'(f(X12),'0'),input).
% 0.95/0.64 cnf(c0,plain,~iLEQ(X14,X15)|'E'('0',f(X15))|'LE'(f(X15),'0')|'E'(s('0'),f(X14)),inference(resolution, status(thm), [clause_10_06, clause_6_04])).
% 0.95/0.64 cnf(c3,plain,'E'('0',f(g(X18)))|'LE'(f(g(X18)),'0')|'E'(s('0'),f(X18)),inference(resolution, status(thm), [c0, clause_3_09])).
% 0.95/0.64 cnf(c10,plain,'E'('0',f(g(X19)))|'E'(s('0'),f(X19)),inference(resolution, status(thm), [c3, clause_7_05])).
% 0.95/0.64 cnf(c12,plain,'E'(s('0'),f(X21))|~'E'('0',f(X21))|'E'(f(X21),f(g(X21))),inference(resolution, status(thm), [c10, clause_11_03])).
% 0.95/0.64 cnf(c20,plain,'E'(s('0'),f(X22))|'E'(f(X22),f(g(X22))),inference(resolution, status(thm), [c12, c5])).
% 0.95/0.64 cnf(clause_1_07,axiom,~'E'(s('0'),f(X13))|~'E'(s('0'),f(g(X13)))|'E'(f(X13),f(g(X13))),input).
% 0.95/0.64 cnf(clause_8_01,axiom,~'E'(f(X6),f(g(X6))),input).
% 0.95/0.64 cnf(clause_7_05,axiom,~'LE'(f(X5),'0'),input).
% 0.95/0.64 cnf(clause_0_02,axiom,iLEQ(X1,X1),input).
% 0.95/0.64 cnf(clause_6_04,axiom,'E'(s('0'),f(X9))|'LE'(f(X9),s('0')),input).
% 0.95/0.64 cnf(clause_10_06,axiom,~'LE'(f(X11),s('0'))|~iLEQ(X11,X12)|'E'('0',f(X12))|'LE'(f(X12),'0'),input).
% 0.95/0.64 cnf(c0,plain,~iLEQ(X14,X15)|'E'('0',f(X15))|'LE'(f(X15),'0')|'E'(s('0'),f(X14)),inference(resolution, status(thm), [clause_10_06, clause_6_04])).
% 0.95/0.64 cnf(c2,plain,'E'('0',f(X16))|'LE'(f(X16),'0')|'E'(s('0'),f(X16)),inference(resolution, status(thm), [c0, clause_0_02])).
% 0.95/0.64 cnf(c5,plain,'E'('0',f(X17))|'E'(s('0'),f(X17)),inference(resolution, status(thm), [c2, clause_7_05])).
% 0.95/0.64 cnf(clause_11_03,axiom,~'E'('0',f(X10))|~'E'('0',f(g(X10)))|'E'(f(X10),f(g(X10))),input).
% 0.95/0.64 cnf(clause_7_05,axiom,~'LE'(f(X5),'0'),input).
% 0.95/0.64 cnf(clause_3_09,axiom,iLEQ(X3,g(X3)),input).
% 0.95/0.64 cnf(clause_6_04,axiom,'E'(s('0'),f(X9))|'LE'(f(X9),s('0')),input).
% 0.95/0.64 cnf(clause_10_06,axiom,~'LE'(f(X11),s('0'))|~iLEQ(X11,X12)|'E'('0',f(X12))|'LE'(f(X12),'0'),input).
% 0.95/0.64 cnf(c0,plain,~iLEQ(X14,X15)|'E'('0',f(X15))|'LE'(f(X15),'0')|'E'(s('0'),f(X14)),inference(resolution, status(thm), [clause_10_06, clause_6_04])).
% 0.95/0.64 cnf(c3,plain,'E'('0',f(g(X18)))|'LE'(f(g(X18)),'0')|'E'(s('0'),f(X18)),inference(resolution, status(thm), [c0, clause_3_09])).
% 0.95/0.64 cnf(c10,plain,'E'('0',f(g(X19)))|'E'(s('0'),f(X19)),inference(resolution, status(thm), [c3, clause_7_05])).
% 0.95/0.64 cnf(c12,plain,'E'(s('0'),f(X21))|~'E'('0',f(X21))|'E'(f(X21),f(g(X21))),inference(resolution, status(thm), [c10, clause_11_03])).
% 0.95/0.64 cnf(c20,plain,'E'(s('0'),f(X22))|'E'(f(X22),f(g(X22))),inference(resolution, status(thm), [c12, c5])).
% 0.95/0.64 cnf(c25,plain,'E'(s('0'),f(X23)),inference(resolution, status(thm), [c20, clause_8_01])).
% 0.95/0.64 cnf(c26,plain,~'E'(s('0'),f(X24))|'E'(f(X24),f(g(X24))),inference(resolution, status(thm), [c25, clause_1_07])).
% 0.95/0.64 cnf(c29,plain,'E'(f(X25),f(g(X25))),inference(resolution, status(thm), [c26, c20])).
% 0.95/0.64 cnf(c35,plain,$false,inference(resolution, status(thm), [c29, clause_8_01])).
% 0.95/0.64 % SZS output end CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.95/0.64 # Filename : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.95/0.64 # Indexed : true
% 0.95/0.64 # Eval function name : PickGiven5
% 0.95/0.64 # Initial clauses : 12
% 0.95/0.64 # Processed clauses : 19
% 0.95/0.64 # Factors computed : 0
% 0.95/0.64 # Resolvents computed: 36
% 0.95/0.64 # Tautologies deleted: 0
% 0.95/0.64 # Forward subsumed : 5
% 0.95/0.64 # Backward subsumed : 19
% 0.95/0.64 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.95/0.64 # SZS Expected : Unsatisfiable
% 0.95/0.64 # time : 141ms
% 0.95/0.64
%------------------------------------------------------------------------------