TSTP Solution File: HWV003-3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : HWV003-3 : TPTP v8.1.0. Released v2.7.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 : Sat Jul 16 14:10:27 EDT 2022
% Result : Unsatisfiable 0.13s 0.33s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : HWV003-3 : TPTP v8.1.0. Released v2.7.0.
% 0.00/0.09 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.09/0.29 % Computer : n020.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Thu Jun 16 21:06:19 EDT 2022
% 0.13/0.29 % CPUTime :
% 0.13/0.32 # No SInE strategy applied
% 0.13/0.32 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b
% 0.13/0.32 # and selection function SelectCQIPrecW.
% 0.13/0.32 #
% 0.13/0.32 # Presaturation interreduction done
% 0.13/0.32 # Number of axioms: 61 Number of unprocessed: 61
% 0.13/0.32 # Tableaux proof search.
% 0.13/0.32 # APR header successfully linked.
% 0.13/0.32 # Hello from C++
% 0.13/0.32 # The folding up rule is enabled...
% 0.13/0.32 # Local unification is enabled...
% 0.13/0.32 # Any saturation attempts will use folding labels...
% 0.13/0.32 # 61 beginning clauses after preprocessing and clausification
% 0.13/0.32 # Creating start rules for all 61 conjectures.
% 0.13/0.32 # There are 61 start rule candidates:
% 0.13/0.32 # Found 0 unit axioms.
% 0.13/0.32 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.32 # 61 start rule tableaux created.
% 0.13/0.32 # 61 extension rule candidate clauses
% 0.13/0.32 # 0 unit axiom clauses
% 0.13/0.32
% 0.13/0.32 # Requested 8, 32 cores available to the main process.
% 0.13/0.33 # There were 3 total branch saturation attempts.
% 0.13/0.33 # There were 0 of these attempts blocked.
% 0.13/0.33 # There were 0 deferred branch saturation attempts.
% 0.13/0.33 # There were 0 free duplicated saturations.
% 0.13/0.33 # There were 3 total successful branch saturations.
% 0.13/0.33 # There were 1 successful branch saturations in interreduction.
% 0.13/0.33 # There were 0 successful branch saturations on the branch.
% 0.13/0.33 # There were 2 successful branch saturations after the branch.
% 0.13/0.33 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.33 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.33 # Begin clausification derivation
% 0.13/0.33
% 0.13/0.33 # End clausification derivation
% 0.13/0.33 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.33 cnf(i_0_62, negated_conjecture, (a|a11)).
% 0.13/0.33 cnf(i_0_100, negated_conjecture, (~a24|~cI)).
% 0.13/0.33 cnf(i_0_101, negated_conjecture, (a|~a25)).
% 0.13/0.33 cnf(i_0_102, negated_conjecture, (b|~a25)).
% 0.13/0.33 cnf(i_0_93, negated_conjecture, (cI|~a22)).
% 0.13/0.33 cnf(i_0_63, negated_conjecture, (b|a11)).
% 0.13/0.33 cnf(i_0_66, negated_conjecture, (a12|a11)).
% 0.13/0.33 cnf(i_0_105, negated_conjecture, (a25|~a26)).
% 0.13/0.33 cnf(i_0_111, negated_conjecture, (c2|~a22)).
% 0.13/0.33 cnf(i_0_112, negated_conjecture, (c2|~a26)).
% 0.13/0.33 cnf(i_0_64, negated_conjecture, (~b|~a|~a11)).
% 0.13/0.33 cnf(i_0_69, negated_conjecture, (a13|a11)).
% 0.13/0.33 cnf(i_0_96, negated_conjecture, (a23|~a)).
% 0.13/0.33 cnf(i_0_97, negated_conjecture, (a23|~b)).
% 0.13/0.33 cnf(i_0_94, negated_conjecture, (a23|~a22)).
% 0.13/0.33 cnf(i_0_104, negated_conjecture, (a24|~a26)).
% 0.13/0.33 cnf(i_0_87, negated_conjecture, (c1|a11)).
% 0.13/0.33 cnf(i_0_65, negated_conjecture, (a12|a)).
% 0.13/0.33 cnf(i_0_67, negated_conjecture, (~a12|~a|~a11)).
% 0.13/0.33 cnf(i_0_70, negated_conjecture, (~a13|~b|~a11)).
% 0.13/0.33 cnf(i_0_88, negated_conjecture, (~c1|~a15|~a11)).
% 0.13/0.33 cnf(i_0_92, negated_conjecture, (~a21|~b|~a)).
% 0.13/0.33 cnf(i_0_68, negated_conjecture, (a13|b)).
% 0.13/0.33 cnf(i_0_73, negated_conjecture, (~a14|~a13|~a12)).
% 0.13/0.33 cnf(i_0_76, negated_conjecture, (~cI|~a15|~a14)).
% 0.13/0.33 cnf(i_0_79, negated_conjecture, (~a16|~a15|~a14)).
% 0.13/0.33 cnf(i_0_82, negated_conjecture, (~a17|~cI|~a15)).
% 0.13/0.33 cnf(i_0_71, negated_conjecture, (a14|a12)).
% 0.13/0.33 cnf(i_0_72, negated_conjecture, (a14|a13)).
% 0.13/0.33 cnf(i_0_110, negated_conjecture, (~s2|~a21|~cI)).
% 0.13/0.33 cnf(i_0_85, negated_conjecture, (~s1|~a17|~a16)).
% 0.13/0.33 cnf(i_0_117, negated_conjecture, (~conjline18|~s2|~s1)).
% 0.13/0.33 cnf(i_0_121, negated_conjecture, (~conjline19|~c2|~c1)).
% 0.13/0.33 cnf(i_0_74, negated_conjecture, (a15|a14)).
% 0.13/0.33 cnf(i_0_77, negated_conjecture, (a16|a14)).
% 0.13/0.33 cnf(i_0_75, negated_conjecture, (cI|a15)).
% 0.13/0.33 cnf(i_0_78, negated_conjecture, (a16|a15)).
% 0.13/0.33 cnf(i_0_80, negated_conjecture, (a17|a15)).
% 0.13/0.33 cnf(i_0_86, negated_conjecture, (c1|a15)).
% 0.13/0.33 cnf(i_0_81, negated_conjecture, (a17|cI)).
% 0.13/0.33 cnf(i_0_95, negated_conjecture, (a22|~a23|~cI)).
% 0.13/0.33 cnf(i_0_106, negated_conjecture, (a26|~a25|~a24)).
% 0.13/0.33 cnf(i_0_99, negated_conjecture, (a24|cI)).
% 0.13/0.33 cnf(i_0_83, negated_conjecture, (s1|a16)).
% 0.13/0.33 cnf(i_0_84, negated_conjecture, (s1|a17)).
% 0.13/0.33 cnf(i_0_122, negated_conjecture, (conjline19|conjline18)).
% 0.13/0.33 cnf(i_0_103, negated_conjecture, (a25|~b|~a)).
% 0.13/0.33 cnf(i_0_91, negated_conjecture, (b|a|~a21)).
% 0.13/0.33 cnf(i_0_98, negated_conjecture, (b|a|~a23)).
% 0.13/0.33 cnf(i_0_89, negated_conjecture, (a21|a|~b)).
% 0.13/0.33 cnf(i_0_90, negated_conjecture, (a21|b|~a)).
% 0.13/0.33 cnf(i_0_109, negated_conjecture, (a21|cI|~s2)).
% 0.13/0.33 cnf(i_0_116, negated_conjecture, (s2|s1|~conjline18)).
% 0.13/0.33 cnf(i_0_120, negated_conjecture, (c2|c1|~conjline19)).
% 0.13/0.33 cnf(i_0_107, negated_conjecture, (s2|cI|~a21)).
% 0.13/0.33 cnf(i_0_114, negated_conjecture, (conjline18|s1|~s2)).
% 0.13/0.33 cnf(i_0_118, negated_conjecture, (conjline19|c1|~c2)).
% 0.13/0.33 cnf(i_0_108, negated_conjecture, (s2|a21|~cI)).
% 0.13/0.33 cnf(i_0_113, negated_conjecture, (a26|a22|~c2)).
% 0.13/0.33 cnf(i_0_115, negated_conjecture, (conjline18|s2|~s1)).
% 0.13/0.33 cnf(i_0_119, negated_conjecture, (conjline19|c2|~c1)).
% 0.13/0.33 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.33 # Begin printing tableau
% 0.13/0.33 # Found 6 steps
% 0.13/0.33 cnf(i_0_113, negated_conjecture, (a26|a22|~c2), inference(start_rule)).
% 0.13/0.33 cnf(i_0_129, plain, (a26), inference(extension_rule, [i_0_104])).
% 0.13/0.33 cnf(i_0_394, plain, (a24), inference(extension_rule, [i_0_100])).
% 0.13/0.33 cnf(i_0_130, plain, (a22), inference(etableau_closure_rule, [i_0_130, ...])).
% 0.13/0.33 cnf(i_0_131, plain, (~c2), inference(etableau_closure_rule, [i_0_131, ...])).
% 0.13/0.33 cnf(i_0_543, plain, (~cI), inference(etableau_closure_rule, [i_0_543, ...])).
% 0.13/0.33 # End printing tableau
% 0.13/0.33 # SZS output end
% 0.13/0.33 # Branches closed with saturation will be marked with an "s"
% 0.13/0.33 # Child (15180) has found a proof.
% 0.13/0.33
% 0.13/0.33 # Proof search is over...
% 0.13/0.33 # Freeing feature tree
%------------------------------------------------------------------------------