TSTP Solution File: SYN534-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN534-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 : n010.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:12:12 EDT 2022
% Result : Satisfiable 0.22s 0.47s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SYN534-1 : TPTP v8.1.0. Released v2.1.0.
% 0.08/0.15 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.15/0.36 % Computer : n010.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 : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Mon Jul 11 19:50:00 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.15/0.39 # No SInE strategy applied
% 0.15/0.39 # Auto-Mode selected heuristic H_____011_C07_F1_PI_AE_OS_S1U
% 0.15/0.39 # and selection function SelectComplexAHPExceptRRHorn.
% 0.15/0.39 #
% 0.15/0.39 # Number of axioms: 77 Number of unprocessed: 77
% 0.15/0.39 # Tableaux proof search.
% 0.15/0.39 # APR header successfully linked.
% 0.15/0.39 # Hello from C++
% 0.15/0.40 # The folding up rule is enabled...
% 0.15/0.40 # Local unification is enabled...
% 0.15/0.40 # Any saturation attempts will use folding labels...
% 0.15/0.40 # 77 beginning clauses after preprocessing and clausification
% 0.15/0.40 # Creating start rules for all 77 conjectures.
% 0.15/0.40 # There are 77 start rule candidates:
% 0.15/0.40 # Found 0 unit axioms.
% 0.15/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.15/0.40 # 77 start rule tableaux created.
% 0.15/0.40 # 77 extension rule candidate clauses
% 0.15/0.40 # 0 unit axiom clauses
% 0.15/0.40
% 0.15/0.40 # Requested 8, 32 cores available to the main process.
% 0.22/0.47 # 21404 Satisfiable branch
% 0.22/0.47 # Satisfiable branch found.
% 0.22/0.47 # There were 1 total branch saturation attempts.
% 0.22/0.47 # There were 0 of these attempts blocked.
% 0.22/0.47 # There were 0 deferred branch saturation attempts.
% 0.22/0.47 # There were 0 free duplicated saturations.
% 0.22/0.47 # There were 0 total successful branch saturations.
% 0.22/0.47 # There were 0 successful branch saturations in interreduction.
% 0.22/0.47 # There were 0 successful branch saturations on the branch.
% 0.22/0.47 # There were 0 successful branch saturations after the branch.
% 0.22/0.47 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.47 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.47 # Begin clausification derivation
% 0.22/0.47
% 0.22/0.47 # End clausification derivation
% 0.22/0.47 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.22/0.47 cnf(i_0_78, negated_conjecture, (ndr1_0|c3_0)).
% 0.22/0.47 cnf(i_0_83, negated_conjecture, (ndr1_0|ssSkC0)).
% 0.22/0.47 cnf(i_0_81, negated_conjecture, (ndr1_0|ssSkC3)).
% 0.22/0.47 cnf(i_0_82, negated_conjecture, (ndr1_0|ssSkC2)).
% 0.22/0.47 cnf(i_0_80, negated_conjecture, (c5_0|c1_0)).
% 0.22/0.47 cnf(i_0_79, negated_conjecture, (ndr1_0|~ssSkC0)).
% 0.22/0.47 cnf(i_0_99, negated_conjecture, (~c3_0|~c2_0)).
% 0.22/0.47 cnf(i_0_97, negated_conjecture, (ndr1_0|c2_0|~c1_0)).
% 0.22/0.47 cnf(i_0_86, negated_conjecture, (ndr1_0|c2_0|~ssSkC2)).
% 0.22/0.47 cnf(i_0_95, negated_conjecture, (ndr1_0|c4_0|~c3_0)).
% 0.22/0.47 cnf(i_0_98, negated_conjecture, (c3_0|c1_0|~c5_0)).
% 0.22/0.47 cnf(i_0_91, negated_conjecture, (ndr1_0|~c5_0|~ssSkC3)).
% 0.22/0.47 cnf(i_0_84, negated_conjecture, (c3_0|c3_1(a491))).
% 0.22/0.47 cnf(i_0_85, negated_conjecture, (c3_0|c5_1(a491))).
% 0.22/0.47 cnf(i_0_90, negated_conjecture, (ssSkC0|c5_1(a472))).
% 0.22/0.47 cnf(i_0_89, negated_conjecture, (ssSkC0|ndr1_1(a472))).
% 0.22/0.47 cnf(i_0_87, negated_conjecture, (ndr1_1(a474)|~ssSkC0)).
% 0.22/0.47 cnf(i_0_92, negated_conjecture, (c2_0|ndr1_1(a485)|~ssSkC2)).
% 0.22/0.47 cnf(i_0_93, negated_conjecture, (c2_0|c2_1(a485)|~ssSkC2)).
% 0.22/0.47 cnf(i_0_94, negated_conjecture, (c2_0|c4_1(a485)|~ssSkC2)).
% 0.22/0.47 cnf(i_0_111, negated_conjecture, (c4_0|c5_1(a479)|~c3_0)).
% 0.22/0.47 cnf(i_0_107, negated_conjecture, (c2_1(a488)|~c5_0|~ssSkC3)).
% 0.22/0.47 cnf(i_0_106, negated_conjecture, (c4_1(a488)|~c5_0|~ssSkC3)).
% 0.22/0.47 cnf(i_0_105, negated_conjecture, (ssSkC0|~c1_1(a472))).
% 0.22/0.47 cnf(i_0_102, negated_conjecture, (ssSkC3|~c2_1(a487))).
% 0.22/0.47 cnf(i_0_103, negated_conjecture, (ssSkC2|~c3_1(a484))).
% 0.22/0.47 cnf(i_0_104, negated_conjecture, (ssSkC2|~c1_1(a484))).
% 0.22/0.47 cnf(i_0_116, negated_conjecture, (c2_0|~c1_0|~c2_1(a471))).
% 0.22/0.47 cnf(i_0_117, negated_conjecture, (c2_0|~c1_0|~c4_1(a471))).
% 0.22/0.47 cnf(i_0_88, negated_conjecture, (ndr1_1(X1)|ssSkP0(X1))).
% 0.22/0.47 cnf(i_0_118, negated_conjecture, (c3_0|c5_0|c3_1(X1)|c1_1(X1)|~ndr1_0)).
% 0.22/0.47 cnf(i_0_120, negated_conjecture, (c1_0|c3_1(X1)|c5_1(X1)|~ndr1_0|~c3_0)).
% 0.22/0.47 cnf(i_0_96, negated_conjecture, (c2_2(a474,a475)|~ssSkC0)).
% 0.22/0.47 cnf(i_0_109, negated_conjecture, (c2_0|c2_2(a485,a486)|~ssSkC2)).
% 0.22/0.47 cnf(i_0_108, negated_conjecture, (c2_0|c3_2(a485,a486)|~ssSkC2)).
% 0.22/0.47 cnf(i_0_110, negated_conjecture, (c2_0|c5_2(a485,a486)|~ssSkC2)).
% 0.22/0.47 cnf(i_0_121, negated_conjecture, (c4_0|ndr1_1(X1)|~ndr1_0|~c2_0|~c2_1(X1))).
% 0.22/0.47 cnf(i_0_100, negated_conjecture, (ssSkP0(X1)|c3_2(X1,a489))).
% 0.22/0.47 cnf(i_0_101, negated_conjecture, (ssSkP0(X1)|c5_2(X1,a489))).
% 0.22/0.47 cnf(i_0_122, negated_conjecture, (ssSkC1|c5_1(X1)|ndr1_1(X1)|~ndr1_0|~c2_1(X1))).
% 0.22/0.47 cnf(i_0_119, negated_conjecture, (ssSkC2|c4_2(a484,X1)|~ndr1_1(a484))).
% 0.22/0.47 cnf(i_0_115, negated_conjecture, (ssSkC0|~c3_2(a472,a473))).
% 0.22/0.47 cnf(i_0_114, negated_conjecture, (ssSkC0|~c5_2(a472,a473))).
% 0.22/0.47 cnf(i_0_112, negated_conjecture, (~ssSkC0|~c5_2(a474,a475))).
% 0.22/0.47 cnf(i_0_123, negated_conjecture, (c3_0|ndr1_1(X1)|c2_1(X1)|~ndr1_0|~c5_0|~ssSkP0(X1))).
% 0.22/0.47 cnf(i_0_135, negated_conjecture, (c5_0|c4_1(X1)|~ndr1_0|~c2_0|~c3_1(X1)|~c5_1(X1))).
% 0.22/0.47 cnf(i_0_125, negated_conjecture, (c4_0|c2_2(X1,a483)|~ndr1_0|~c2_0|~c2_1(X1))).
% 0.22/0.47 cnf(i_0_124, negated_conjecture, (c4_0|c3_2(X1,a483)|~ndr1_0|~c2_0|~c2_1(X1))).
% 0.22/0.47 cnf(i_0_126, negated_conjecture, (c4_0|c1_2(X1,a483)|~ndr1_0|~c2_0|~c2_1(X1))).
% 0.22/0.47 cnf(i_0_134, negated_conjecture, (c2_1(X1)|c1_1(a478)|~ndr1_0|~ssSkC1|~c4_1(X1)|~c1_1(X1))).
% 0.22/0.47 cnf(i_0_113, negated_conjecture, (ssSkP0(X1)|~c2_2(X1,a489))).
% 0.22/0.47 cnf(i_0_136, negated_conjecture, (c2_1(X1)|~ndr1_0|~ssSkC1|~c4_1(X1)|~c1_1(X1)|~c2_1(a478))).
% 0.22/0.47 cnf(i_0_128, negated_conjecture, (ssSkC1|c5_1(X1)|c5_2(X1,a477)|~ndr1_0|~c2_1(X1))).
% 0.22/0.47 cnf(i_0_129, negated_conjecture, (ssSkC1|c5_1(X1)|c1_2(X1,a477)|~ndr1_0|~c2_1(X1))).
% 0.22/0.47 cnf(i_0_130, negated_conjecture, (c3_0|c2_1(X1)|c1_2(X1,a490)|~ndr1_0|~c5_0|~ssSkP0(X1))).
% 0.22/0.47 cnf(i_0_131, negated_conjecture, (c4_2(a488,X1)|c1_2(a488,X1)|~c5_0|~ssSkC3|~ndr1_1(a488))).
% 0.22/0.47 cnf(i_0_132, negated_conjecture, (ssSkC1|c5_1(X1)|~ndr1_0|~c2_1(X1)|~c2_2(X1,a477))).
% 0.22/0.47 cnf(i_0_133, negated_conjecture, (c3_0|c2_1(X1)|~ndr1_0|~c5_0|~ssSkP0(X1)|~c3_2(X1,a490))).
% 0.22/0.47 cnf(i_0_127, negated_conjecture, (c4_2(a474,X1)|~ssSkC0|~ndr1_1(a474)|~c3_2(a474,X1))).
% 0.22/0.47 cnf(i_0_138, negated_conjecture, (ssSkC3|c4_2(a487,X1)|~ndr1_1(a487)|~c2_2(a487,X1)|~c5_2(a487,X1))).
% 0.22/0.47 cnf(i_0_137, negated_conjecture, (c1_2(a474,X1)|~ssSkC0|~ndr1_1(a474)|~c5_2(a474,X1)|~c4_2(a474,X1))).
% 0.22/0.47 cnf(i_0_139, negated_conjecture, (c4_0|~c3_0|~ndr1_1(a479)|~c2_2(a479,X1)|~c5_2(a479,X1)|~c1_2(a479,X1))).
% 0.22/0.47 cnf(i_0_141, negated_conjecture, (c2_0|c1_1(X1)|c5_2(X1,X2)|~ndr1_0|~c5_0|~c3_1(X1)|~ndr1_1(X1)|~c3_2(X1,X2)|~c1_2(X1,X2))).
% 0.22/0.47 cnf(i_0_145, negated_conjecture, (c2_1(X1)|~ndr1_0|~ssSkC1|~c4_1(X1)|~c1_1(X1)|~ndr1_1(a478)|~c2_2(a478,X2)|~c4_2(a478,X2)|~c1_2(a478,X2))).
% 0.22/0.47 cnf(i_0_142, negated_conjecture, (c4_0|c3_2(X1,X2)|c5_2(X1,X2)|~ndr1_0|~c2_0|~c3_1(X1)|~ndr1_1(X1)|~c4_2(X1,X2)|~c3_2(X1,a476))).
% 0.22/0.47 cnf(i_0_144, negated_conjecture, (c4_0|c3_2(X1,X2)|c5_2(X1,X2)|~ndr1_0|~c2_0|~c3_1(X1)|~ndr1_1(X1)|~c4_2(X1,X2)|~c5_2(X1,a476))).
% 0.22/0.47 cnf(i_0_143, negated_conjecture, (c4_0|c3_2(X1,X2)|c5_2(X1,X2)|~ndr1_0|~c2_0|~c3_1(X1)|~ndr1_1(X1)|~c4_2(X1,X2)|~c1_2(X1,a476))).
% 0.22/0.47 cnf(i_0_140, negated_conjecture, (c4_0|c2_1(X3)|c4_1(X1)|c1_1(X1)|~ndr1_0|~ndr1_1(X1)|~c2_2(X1,X2)|~c5_2(X1,X2)|~c4_2(X1,X2))).
% 0.22/0.47 cnf(i_0_146, negated_conjecture, (c5_0|c2_1(X1)|ndr1_1(a480)|c2_2(X1,X2)|c4_2(X1,X3)|~ndr1_0|~ndr1_1(X1)|~c3_2(X1,X3)|~c5_2(X1,X3)|~c5_2(X1,X2)|~c4_2(X1,X2))).
% 0.22/0.47 cnf(i_0_149, negated_conjecture, (c5_0|c2_1(X1)|c2_2(X1,X2)|c4_2(X1,X3)|~ndr1_0|~ndr1_1(X1)|~c5_1(a480)|~c3_2(X1,X3)|~c5_2(X1,X3)|~c5_2(X1,X2)|~c4_2(X1,X2))).
% 0.22/0.47 cnf(i_0_148, negated_conjecture, (c5_0|c2_1(X1)|c2_2(X1,X2)|c4_2(X1,X3)|c2_2(a480,a481)|~ndr1_0|~ndr1_1(X1)|~c3_2(X1,X3)|~c5_2(X1,X3)|~c5_2(X1,X2)|~c4_2(X1,X2))).
% 0.22/0.47 cnf(i_0_147, negated_conjecture, (c5_0|c2_1(X1)|c2_2(X1,X2)|c4_2(X1,X3)|c1_2(a480,a481)|~ndr1_0|~ndr1_1(X1)|~c3_2(X1,X3)|~c5_2(X1,X3)|~c5_2(X1,X2)|~c4_2(X1,X2))).
% 0.22/0.47 cnf(i_0_151, negated_conjecture, (ndr1_1(X4)|c4_1(X1)|c1_1(X4)|c5_2(X1,X2)|c1_2(X1,X2)|~ndr1_0|~c3_0|~ndr1_1(X1)|~c2_1(X4)|~c2_2(X1,X3)|~c4_2(X1,X3)|~c4_2(X1,X2)|~c1_2(X1,X3))).
% 0.22/0.47 cnf(i_0_150, negated_conjecture, (c5_0|c2_1(X1)|c2_2(X1,X2)|c4_2(X1,X3)|~ndr1_0|~ndr1_1(X1)|~c3_2(X1,X3)|~c5_2(X1,X3)|~c5_2(X1,X2)|~c4_2(X1,X2)|~c4_2(a480,a481))).
% 0.22/0.47 cnf(i_0_152, negated_conjecture, (c4_1(X1)|c1_1(X4)|c5_2(X1,X2)|c1_2(X1,X2)|c3_2(X4,a482)|~ndr1_0|~c3_0|~ndr1_1(X1)|~c2_1(X4)|~c2_2(X1,X3)|~c4_2(X1,X3)|~c4_2(X1,X2)|~c1_2(X1,X3))).
% 0.22/0.47 cnf(i_0_153, negated_conjecture, (c4_1(X1)|c1_1(X4)|c5_2(X1,X2)|c1_2(X1,X2)|c1_2(X4,a482)|~ndr1_0|~c3_0|~ndr1_1(X1)|~c2_1(X4)|~c2_2(X1,X3)|~c4_2(X1,X3)|~c4_2(X1,X2)|~c1_2(X1,X3))).
% 0.22/0.47 cnf(i_0_154, negated_conjecture, (c4_1(X1)|c1_1(X4)|c5_2(X1,X2)|c1_2(X1,X2)|~ndr1_0|~c3_0|~ndr1_1(X1)|~c2_1(X4)|~c2_2(X1,X3)|~c4_2(X1,X3)|~c4_2(X1,X2)|~c1_2(X1,X3)|~c4_2(X4,a482))).
% 0.22/0.47 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.22/0.47 # Begin printing tableau
% 0.22/0.47 # Found 3 steps
% 0.22/0.47 cnf(i_0_95, negated_conjecture, (ndr1_0|c4_0|~c3_0), inference(start_rule)).
% 0.22/0.47 cnf(i_0_503, plain, (ndr1_0), inference(extension_rule, [i_0_145])).
% 0.22/0.47 cnf(i_0_27776, plain, (c2_1(a487)), inference(extension_rule, [i_0_102])).
% 0.22/0.47 # End printing tableau
% 0.22/0.47 # SZS output end
% 0.22/0.47 # Branches closed with saturation will be marked with an "s"
% 0.22/0.47 # Child (21404) has found a proof.
% 0.22/0.47
% 0.22/0.48 # Proof search is over...
% 0.22/0.48 # Freeing feature tree
%------------------------------------------------------------------------------