TSTP Solution File: SYN430-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN430-1 : TPTP v8.1.0. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n020.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 : Thu Jul 21 06:10:59 EDT 2022
% Result : Satisfiable 0.19s 0.43s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN430-1 : TPTP v8.1.0. Released v2.1.0.
% 0.12/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.34 % Computer : n020.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 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 Jul 11 16:52:42 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_PS_S0S
% 0.12/0.37 # and selection function SelectComplexG.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37 # Number of axioms: 116 Number of unprocessed: 116
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 116 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 116 conjectures.
% 0.12/0.37 # There are 116 start rule candidates:
% 0.12/0.37 # Found 0 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 116 start rule tableaux created.
% 0.12/0.37 # 116 extension rule candidate clauses
% 0.12/0.37 # 0 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.43 # 3964 Satisfiable branch
% 0.19/0.43 # Satisfiable branch found.
% 0.19/0.43 # There were 1 total branch saturation attempts.
% 0.19/0.43 # There were 0 of these attempts blocked.
% 0.19/0.43 # There were 0 deferred branch saturation attempts.
% 0.19/0.43 # There were 0 free duplicated saturations.
% 0.19/0.43 # There were 0 total successful branch saturations.
% 0.19/0.43 # There were 0 successful branch saturations in interreduction.
% 0.19/0.43 # There were 0 successful branch saturations on the branch.
% 0.19/0.43 # There were 0 successful branch saturations after the branch.
% 0.19/0.43 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.43 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.43 # Begin clausification derivation
% 0.19/0.43
% 0.19/0.43 # End clausification derivation
% 0.19/0.43 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.43 cnf(i_0_117, negated_conjecture, (ndr1_0|~hskp24)).
% 0.19/0.43 cnf(i_0_118, negated_conjecture, (ndr1_0|~hskp23)).
% 0.19/0.43 cnf(i_0_119, negated_conjecture, (ndr1_0|~hskp22)).
% 0.19/0.43 cnf(i_0_120, negated_conjecture, (ndr1_0|~hskp21)).
% 0.19/0.43 cnf(i_0_121, negated_conjecture, (ndr1_0|~hskp20)).
% 0.19/0.43 cnf(i_0_122, negated_conjecture, (ndr1_0|~hskp19)).
% 0.19/0.43 cnf(i_0_123, negated_conjecture, (ndr1_0|~hskp18)).
% 0.19/0.43 cnf(i_0_124, negated_conjecture, (ndr1_0|~hskp17)).
% 0.19/0.43 cnf(i_0_125, negated_conjecture, (ndr1_0|~hskp16)).
% 0.19/0.43 cnf(i_0_126, negated_conjecture, (ndr1_0|~hskp15)).
% 0.19/0.43 cnf(i_0_127, negated_conjecture, (ndr1_0|~hskp14)).
% 0.19/0.43 cnf(i_0_128, negated_conjecture, (ndr1_0|~hskp13)).
% 0.19/0.43 cnf(i_0_129, negated_conjecture, (ndr1_0|~hskp12)).
% 0.19/0.43 cnf(i_0_130, negated_conjecture, (ndr1_0|~hskp11)).
% 0.19/0.43 cnf(i_0_131, negated_conjecture, (ndr1_0|~hskp10)).
% 0.19/0.43 cnf(i_0_132, negated_conjecture, (ndr1_0|~hskp9)).
% 0.19/0.43 cnf(i_0_133, negated_conjecture, (ndr1_0|~hskp8)).
% 0.19/0.43 cnf(i_0_134, negated_conjecture, (ndr1_0|~hskp7)).
% 0.19/0.43 cnf(i_0_135, negated_conjecture, (ndr1_0|~hskp6)).
% 0.19/0.43 cnf(i_0_136, negated_conjecture, (ndr1_0|~hskp5)).
% 0.19/0.43 cnf(i_0_137, negated_conjecture, (ndr1_0|~hskp4)).
% 0.19/0.43 cnf(i_0_138, negated_conjecture, (ndr1_0|~hskp3)).
% 0.19/0.43 cnf(i_0_139, negated_conjecture, (ndr1_0|~hskp2)).
% 0.19/0.43 cnf(i_0_140, negated_conjecture, (ndr1_0|~hskp1)).
% 0.19/0.43 cnf(i_0_141, negated_conjecture, (ndr1_0|~hskp0)).
% 0.19/0.43 cnf(i_0_173, negated_conjecture, (~c1_1(a131)|~hskp24)).
% 0.19/0.43 cnf(i_0_175, negated_conjecture, (~c1_1(a130)|~hskp23)).
% 0.19/0.43 cnf(i_0_143, negated_conjecture, (hskp8|hskp9|hskp20)).
% 0.19/0.43 cnf(i_0_145, negated_conjecture, (c0_1(a131)|~hskp24)).
% 0.19/0.43 cnf(i_0_174, negated_conjecture, (~c2_1(a130)|~hskp23)).
% 0.19/0.43 cnf(i_0_176, negated_conjecture, (~c0_1(a129)|~hskp22)).
% 0.19/0.43 cnf(i_0_177, negated_conjecture, (~c3_1(a129)|~hskp22)).
% 0.19/0.43 cnf(i_0_178, negated_conjecture, (~c0_1(a119)|~hskp20)).
% 0.19/0.43 cnf(i_0_154, negated_conjecture, (c0_1(a117)|~hskp19)).
% 0.19/0.43 cnf(i_0_180, negated_conjecture, (~c1_1(a117)|~hskp19)).
% 0.19/0.43 cnf(i_0_179, negated_conjecture, (~c2_1(a117)|~hskp19)).
% 0.19/0.43 cnf(i_0_181, negated_conjecture, (~c3_1(a116)|~hskp18)).
% 0.19/0.43 cnf(i_0_182, negated_conjecture, (~c0_1(a115)|~hskp17)).
% 0.19/0.43 cnf(i_0_142, negated_conjecture, (hskp7|hskp17|hskp18)).
% 0.19/0.43 cnf(i_0_156, negated_conjecture, (c0_1(a116)|~hskp18)).
% 0.19/0.43 cnf(i_0_183, negated_conjecture, (~c3_1(a113)|~hskp16)).
% 0.19/0.43 cnf(i_0_184, negated_conjecture, (~c1_1(a113)|~hskp16)).
% 0.19/0.43 cnf(i_0_185, negated_conjecture, (~c0_1(a106)|~hskp15)).
% 0.19/0.43 cnf(i_0_186, negated_conjecture, (~c2_1(a106)|~hskp15)).
% 0.19/0.43 cnf(i_0_159, negated_conjecture, (c0_1(a113)|~hskp16)).
% 0.19/0.43 cnf(i_0_188, negated_conjecture, (~c0_1(a128)|~hskp14)).
% 0.19/0.43 cnf(i_0_187, negated_conjecture, (~c2_1(a128)|~hskp14)).
% 0.19/0.43 cnf(i_0_190, negated_conjecture, (~c3_1(a127)|~hskp13)).
% 0.19/0.43 cnf(i_0_191, negated_conjecture, (~c1_1(a127)|~hskp13)).
% 0.19/0.43 cnf(i_0_144, negated_conjecture, (hskp6|hskp7|hskp11)).
% 0.19/0.43 cnf(i_0_163, negated_conjecture, (c0_1(a126)|~hskp12)).
% 0.19/0.43 cnf(i_0_189, negated_conjecture, (~c2_1(a127)|~hskp13)).
% 0.19/0.43 cnf(i_0_192, negated_conjecture, (~c3_1(a126)|~hskp12)).
% 0.19/0.43 cnf(i_0_193, negated_conjecture, (~c0_1(a123)|~hskp11)).
% 0.19/0.43 cnf(i_0_194, negated_conjecture, (~c1_1(a123)|~hskp11)).
% 0.19/0.43 cnf(i_0_169, negated_conjecture, (c0_1(a111)|~hskp5)).
% 0.19/0.43 cnf(i_0_196, negated_conjecture, (~c3_1(a122)|~hskp10)).
% 0.19/0.43 cnf(i_0_195, negated_conjecture, (~c1_1(a122)|~hskp10)).
% 0.19/0.43 cnf(i_0_199, negated_conjecture, (~c0_1(a120)|~hskp9)).
% 0.19/0.43 cnf(i_0_197, negated_conjecture, (~c1_1(a120)|~hskp9)).
% 0.19/0.43 cnf(i_0_146, negated_conjecture, (c3_1(a131)|~hskp24)).
% 0.19/0.43 cnf(i_0_147, negated_conjecture, (c3_1(a130)|~hskp23)).
% 0.19/0.43 cnf(i_0_198, negated_conjecture, (~c2_1(a120)|~hskp9)).
% 0.19/0.43 cnf(i_0_202, negated_conjecture, (~c0_1(a118)|~hskp8)).
% 0.19/0.43 cnf(i_0_201, negated_conjecture, (~c1_1(a118)|~hskp8)).
% 0.19/0.43 cnf(i_0_200, negated_conjecture, (~c2_1(a118)|~hskp8)).
% 0.19/0.43 cnf(i_0_149, negated_conjecture, (c3_1(a121)|~hskp21)).
% 0.19/0.43 cnf(i_0_203, negated_conjecture, (~c0_1(a114)|~hskp7)).
% 0.19/0.43 cnf(i_0_205, negated_conjecture, (~c0_1(a112)|~hskp6)).
% 0.19/0.43 cnf(i_0_204, negated_conjecture, (~c1_1(a112)|~hskp6)).
% 0.19/0.43 cnf(i_0_206, negated_conjecture, (~c2_1(a112)|~hskp6)).
% 0.19/0.43 cnf(i_0_160, negated_conjecture, (c3_1(a106)|~hskp15)).
% 0.19/0.43 cnf(i_0_161, negated_conjecture, (c3_1(a128)|~hskp14)).
% 0.19/0.43 cnf(i_0_207, negated_conjecture, (~c1_1(a111)|~hskp5)).
% 0.19/0.43 cnf(i_0_208, negated_conjecture, (~c3_1(a110)|~hskp4)).
% 0.19/0.43 cnf(i_0_209, negated_conjecture, (~c1_1(a110)|~hskp4)).
% 0.19/0.43 cnf(i_0_210, negated_conjecture, (~c2_1(a110)|~hskp4)).
% 0.19/0.43 cnf(i_0_164, negated_conjecture, (c3_1(a123)|~hskp11)).
% 0.19/0.43 cnf(i_0_212, negated_conjecture, (~c1_1(a109)|~hskp3)).
% 0.19/0.43 cnf(i_0_211, negated_conjecture, (~c2_1(a109)|~hskp3)).
% 0.19/0.43 cnf(i_0_214, negated_conjecture, (~c1_1(a108)|~hskp2)).
% 0.19/0.43 cnf(i_0_213, negated_conjecture, (~c2_1(a108)|~hskp2)).
% 0.19/0.43 cnf(i_0_170, negated_conjecture, (c3_1(a109)|~hskp3)).
% 0.19/0.43 cnf(i_0_171, negated_conjecture, (c3_1(a108)|~hskp2)).
% 0.19/0.43 cnf(i_0_217, negated_conjecture, (~c0_1(a107)|~hskp1)).
% 0.19/0.43 cnf(i_0_215, negated_conjecture, (~c3_1(a107)|~hskp1)).
% 0.19/0.43 cnf(i_0_216, negated_conjecture, (~c1_1(a107)|~hskp1)).
% 0.19/0.43 cnf(i_0_218, negated_conjecture, (~c1_1(a105)|~hskp0)).
% 0.19/0.43 cnf(i_0_172, negated_conjecture, (c3_1(a105)|~hskp0)).
% 0.19/0.43 cnf(i_0_219, negated_conjecture, (~c2_1(a105)|~hskp0)).
% 0.19/0.43 cnf(i_0_148, negated_conjecture, (c1_1(a129)|~hskp22)).
% 0.19/0.43 cnf(i_0_150, negated_conjecture, (c1_1(a121)|~hskp21)).
% 0.19/0.43 cnf(i_0_152, negated_conjecture, (c1_1(a119)|~hskp20)).
% 0.19/0.43 cnf(i_0_155, negated_conjecture, (c1_1(a116)|~hskp18)).
% 0.19/0.43 cnf(i_0_158, negated_conjecture, (c1_1(a115)|~hskp17)).
% 0.19/0.43 cnf(i_0_162, negated_conjecture, (c1_1(a126)|~hskp12)).
% 0.19/0.43 cnf(i_0_166, negated_conjecture, (c1_1(a114)|~hskp7)).
% 0.19/0.43 cnf(i_0_151, negated_conjecture, (c2_1(a121)|~hskp21)).
% 0.19/0.43 cnf(i_0_153, negated_conjecture, (c2_1(a119)|~hskp20)).
% 0.19/0.43 cnf(i_0_157, negated_conjecture, (c2_1(a115)|~hskp17)).
% 0.19/0.43 cnf(i_0_165, negated_conjecture, (c2_1(a122)|~hskp10)).
% 0.19/0.43 cnf(i_0_167, negated_conjecture, (c2_1(a114)|~hskp7)).
% 0.19/0.43 cnf(i_0_168, negated_conjecture, (c2_1(a111)|~hskp5)).
% 0.19/0.43 cnf(i_0_227, negated_conjecture, (c3_1(X1)|hskp14|hskp22|~c2_1(X1)|~c1_1(X1)|~ndr1_0)).
% 0.19/0.43 cnf(i_0_220, negated_conjecture, (c1_1(X1)|c3_1(X1)|c0_1(X1)|hskp6|hskp16|~ndr1_0)).
% 0.19/0.43 cnf(i_0_223, negated_conjecture, (c2_1(X1)|c3_1(X1)|hskp23|hskp24|~c1_1(X1)|~ndr1_0)).
% 0.19/0.43 cnf(i_0_224, negated_conjecture, (c3_1(X1)|hskp0|hskp15|~c2_1(X1)|~c1_1(X1)|~ndr1_0)).
% 0.19/0.43 cnf(i_0_226, negated_conjecture, (c0_1(X1)|hskp12|hskp13|~c2_1(X1)|~c1_1(X1)|~ndr1_0)).
% 0.19/0.43 cnf(i_0_225, negated_conjecture, (c3_1(X1)|hskp3|hskp4|~c2_1(X1)|~c0_1(X1)|~ndr1_0)).
% 0.19/0.43 cnf(i_0_222, negated_conjecture, (c1_1(X1)|c0_1(X1)|hskp10|hskp21|~c3_1(X1)|~ndr1_0)).
% 0.19/0.43 cnf(i_0_221, negated_conjecture, (c3_1(X1)|c0_1(X1)|hskp1|hskp2|~c1_1(X1)|~ndr1_0)).
% 0.19/0.43 cnf(i_0_230, negated_conjecture, (c2_1(X1)|c0_1(X1)|~c1_1(X2)|~c3_1(X1)|~c3_1(X2)|~c0_1(X2)|~ndr1_0)).
% 0.19/0.43 cnf(i_0_229, negated_conjecture, (c2_1(X1)|c3_1(X2)|c3_1(X1)|hskp5|~c2_1(X2)|~c1_1(X2)|~c0_1(X1)|~ndr1_0)).
% 0.19/0.43 cnf(i_0_228, negated_conjecture, (c2_1(X1)|c2_1(X2)|c3_1(X1)|c0_1(X2)|hskp19|~c1_1(X1)|~c3_1(X2)|~ndr1_0)).
% 0.19/0.43 cnf(i_0_232, negated_conjecture, (c2_1(X1)|c1_1(X2)|c0_1(X2)|c0_1(X1)|~c2_1(X2)|~c2_1(X3)|~c1_1(X1)|~c1_1(X3)|~c0_1(X3)|~ndr1_0)).
% 0.19/0.43 cnf(i_0_231, negated_conjecture, (c2_1(X1)|c2_1(X2)|c1_1(X2)|c0_1(X3)|c0_1(X2)|~c1_1(X1)|~c1_1(X3)|~c3_1(X3)|~c0_1(X1)|~ndr1_0)).
% 0.19/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.43 # Begin printing tableau
% 0.19/0.43 # Found 4 steps
% 0.19/0.43 cnf(i_0_222, negated_conjecture, (c1_1(a105)|c0_1(a105)|hskp10|hskp21|~c3_1(a105)|~ndr1_0), inference(start_rule)).
% 0.19/0.43 cnf(i_0_282, plain, (c1_1(a105)), inference(extension_rule, [i_0_218])).
% 0.19/0.43 cnf(i_0_655, plain, (~hskp0), inference(extension_rule, [i_0_224])).
% 0.19/0.43 cnf(i_0_727, plain, (~c1_1(a105)), inference(closure_rule, [i_0_282])).
% 0.19/0.43 # End printing tableau
% 0.19/0.43 # SZS output end
% 0.19/0.43 # Branches closed with saturation will be marked with an "s"
% 0.19/0.43 # 3963 Satisfiable branch
% 0.19/0.43 # Child (3964) has found a proof.
% 0.19/0.43
% 0.19/0.43 # Proof search is over...
% 0.19/0.43 # Freeing feature tree
%------------------------------------------------------------------------------