TSTP Solution File: REL003+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : REL003+1 : TPTP v8.1.0. Released v4.0.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 : n012.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 : Mon Jul 18 19:20:35 EDT 2022
% Result : Theorem 0.13s 0.39s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : REL003+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jul 8 13:17:44 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.38 #
% 0.13/0.38 # Presaturation interreduction done
% 0.13/0.38 # Number of axioms: 14 Number of unprocessed: 14
% 0.13/0.38 # Tableaux proof search.
% 0.13/0.38 # APR header successfully linked.
% 0.13/0.38 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 14 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 2 conjectures.
% 0.13/0.38 # There are 2 start rule candidates:
% 0.13/0.38 # Found 12 unit axioms.
% 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.38 # 2 start rule tableaux created.
% 0.13/0.38 # 2 extension rule candidate clauses
% 0.13/0.38 # 12 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 2
% 0.13/0.38 # Creating equality axioms
% 0.13/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.38 # Returning from population with 21 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.38 # We now have 21 tableaux to operate on
% 0.13/0.39 # There were 1 total branch saturation attempts.
% 0.13/0.39 # There were 0 of these attempts blocked.
% 0.13/0.39 # There were 0 deferred branch saturation attempts.
% 0.13/0.39 # There were 0 free duplicated saturations.
% 0.13/0.39 # There were 1 total successful branch saturations.
% 0.13/0.39 # There were 0 successful branch saturations in interreduction.
% 0.13/0.39 # There were 0 successful branch saturations on the branch.
% 0.13/0.39 # There were 1 successful branch saturations after the branch.
% 0.13/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # Begin clausification derivation
% 0.13/0.39
% 0.13/0.39 # End clausification derivation
% 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.39 cnf(i_0_8, plain, (converse(converse(X1))=X1)).
% 0.13/0.39 cnf(i_0_6, plain, (composition(X1,one)=X1)).
% 0.13/0.39 cnf(i_0_12, plain, (join(X1,complement(X1))=top)).
% 0.13/0.39 cnf(i_0_9, plain, (join(converse(X1),converse(X2))=converse(join(X1,X2)))).
% 0.13/0.39 cnf(i_0_10, plain, (composition(converse(X1),converse(X2))=converse(composition(X2,X1)))).
% 0.13/0.39 cnf(i_0_2, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))).
% 0.13/0.39 cnf(i_0_13, plain, (complement(top)=zero)).
% 0.13/0.39 cnf(i_0_5, plain, (composition(composition(X1,X2),X3)=composition(X1,composition(X2,X3)))).
% 0.13/0.39 cnf(i_0_7, plain, (join(composition(X1,X2),composition(X3,X2))=composition(join(X1,X3),X2))).
% 0.13/0.39 cnf(i_0_11, plain, (join(complement(X1),composition(converse(X2),complement(composition(X2,X1))))=complement(X1))).
% 0.13/0.39 cnf(i_0_3, plain, (join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1)).
% 0.13/0.39 cnf(i_0_1, plain, (join(X1,X2)=join(X2,X1))).
% 0.13/0.39 cnf(i_0_14, negated_conjecture, (converse(join(esk2_0,esk1_0))!=converse(esk2_0)|join(esk2_0,esk1_0)!=esk2_0)).
% 0.13/0.39 cnf(i_0_17, negated_conjecture, (converse(join(esk2_0,esk1_0))=converse(esk2_0)|join(esk2_0,esk1_0)=esk2_0)).
% 0.13/0.39 cnf(i_0_38, plain, (X31=X31)).
% 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.39 # Begin printing tableau
% 0.13/0.39 # Found 6 steps
% 0.13/0.39 cnf(i_0_8, plain, (converse(converse(X5))=X5), inference(start_rule)).
% 0.13/0.39 cnf(i_0_46, plain, (converse(converse(X5))=X5), inference(extension_rule, [i_0_42])).
% 0.13/0.39 cnf(i_0_75, plain, (converse(converse(X3))!=X3), inference(closure_rule, [i_0_8])).
% 0.13/0.39 cnf(i_0_74, plain, (join(converse(converse(X3)),converse(converse(X5)))=join(X3,X5)), inference(extension_rule, [i_0_41])).
% 0.13/0.39 cnf(i_0_94, plain, (join(X3,X5)!=converse(converse(join(X3,X5)))), inference(closure_rule, [i_0_8])).
% 0.13/0.39 cnf(i_0_92, plain, (join(converse(converse(X3)),converse(converse(X5)))=converse(converse(join(X3,X5)))), inference(etableau_closure_rule, [i_0_92, ...])).
% 0.13/0.39 # End printing tableau
% 0.13/0.39 # SZS output end
% 0.13/0.39 # Branches closed with saturation will be marked with an "s"
% 0.13/0.39 # There were 1 total branch saturation attempts.
% 0.13/0.39 # There were 0 of these attempts blocked.
% 0.13/0.39 # There were 0 deferred branch saturation attempts.
% 0.13/0.39 # There were 0 free duplicated saturations.
% 0.13/0.39 # There were 1 total successful branch saturations.
% 0.13/0.39 # There were 0 successful branch saturations in interreduction.
% 0.13/0.39 # There were 0 successful branch saturations on the branch.
% 0.13/0.39 # There were 1 successful branch saturations after the branch.
% 0.13/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # Begin clausification derivation
% 0.13/0.39
% 0.13/0.39 # End clausification derivation
% 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.39 cnf(i_0_8, plain, (converse(converse(X1))=X1)).
% 0.13/0.39 cnf(i_0_6, plain, (composition(X1,one)=X1)).
% 0.13/0.39 cnf(i_0_12, plain, (join(X1,complement(X1))=top)).
% 0.13/0.39 cnf(i_0_9, plain, (join(converse(X1),converse(X2))=converse(join(X1,X2)))).
% 0.13/0.39 cnf(i_0_10, plain, (composition(converse(X1),converse(X2))=converse(composition(X2,X1)))).
% 0.13/0.39 cnf(i_0_2, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))).
% 0.13/0.39 cnf(i_0_13, plain, (complement(top)=zero)).
% 0.13/0.39 cnf(i_0_5, plain, (composition(composition(X1,X2),X3)=composition(X1,composition(X2,X3)))).
% 0.13/0.39 cnf(i_0_7, plain, (join(composition(X1,X2),composition(X3,X2))=composition(join(X1,X3),X2))).
% 0.13/0.39 cnf(i_0_11, plain, (join(complement(X1),composition(converse(X2),complement(composition(X2,X1))))=complement(X1))).
% 0.13/0.39 cnf(i_0_3, plain, (join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1)).
% 0.13/0.39 cnf(i_0_1, plain, (join(X1,X2)=join(X2,X1))).
% 0.13/0.39 cnf(i_0_14, negated_conjecture, (converse(join(esk2_0,esk1_0))!=converse(esk2_0)|join(esk2_0,esk1_0)!=esk2_0)).
% 0.13/0.39 cnf(i_0_17, negated_conjecture, (converse(join(esk2_0,esk1_0))=converse(esk2_0)|join(esk2_0,esk1_0)=esk2_0)).
% 0.13/0.39 cnf(i_0_38, plain, (X31=X31)).
% 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.39 # Begin printing tableau
% 0.13/0.39 # Found 6 steps
% 0.13/0.39 cnf(i_0_8, plain, (converse(converse(X3))=X3), inference(start_rule)).
% 0.13/0.39 cnf(i_0_46, plain, (converse(converse(X3))=X3), inference(extension_rule, [i_0_42])).
% 0.13/0.39 cnf(i_0_76, plain, (converse(converse(X5))!=X5), inference(closure_rule, [i_0_8])).
% 0.13/0.39 cnf(i_0_74, plain, (join(converse(converse(X3)),converse(converse(X5)))=join(X3,X5)), inference(extension_rule, [i_0_41])).
% 0.13/0.39 cnf(i_0_94, plain, (join(X3,X5)!=converse(converse(join(X3,X5)))), inference(closure_rule, [i_0_8])).
% 0.13/0.39 cnf(i_0_92, plain, (join(converse(converse(X3)),converse(converse(X5)))=converse(converse(join(X3,X5)))), inference(etableau_closure_rule, [i_0_92, ...])).
% 0.13/0.39 # End printing tableau
% 0.13/0.39 # SZS output end
% 0.13/0.39 # Branches closed with saturation will be marked with an "s"
% 0.13/0.39 # There were 1 total branch saturation attempts.
% 0.13/0.39 # There were 0 of these attempts blocked.
% 0.13/0.39 # There were 0 deferred branch saturation attempts.
% 0.13/0.39 # There were 0 free duplicated saturations.
% 0.13/0.39 # There were 1 total successful branch saturations.
% 0.13/0.39 # There were 0 successful branch saturations in interreduction.
% 0.13/0.39 # There were 0 successful branch saturations on the branch.
% 0.13/0.39 # There were 1 successful branch saturations after the branch.
% 0.13/0.39 # There were 1 total branch saturation attempts.
% 0.13/0.39 # There were 0 of these attempts blocked.
% 0.13/0.39 # There were 0 deferred branch saturation attempts.
% 0.13/0.39 # There were 0 free duplicated saturations.
% 0.13/0.39 # There were 1 total successful branch saturations.
% 0.13/0.39 # There were 0 successful branch saturations in interreduction.
% 0.13/0.39 # There were 0 successful branch saturations on the branch.
% 0.13/0.39 # There were 1 successful branch saturations after the branch.
% 0.13/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # Begin clausification derivation
% 0.13/0.39
% 0.13/0.39 # End clausification derivation
% 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.39 cnf(i_0_8, plain, (converse(converse(X1))=X1)).
% 0.13/0.39 cnf(i_0_6, plain, (composition(X1,one)=X1)).
% 0.13/0.39 cnf(i_0_12, plain, (join(X1,complement(X1))=top)).
% 0.13/0.39 cnf(i_0_9, plain, (join(converse(X1),converse(X2))=converse(join(X1,X2)))).
% 0.13/0.39 cnf(i_0_10, plain, (composition(converse(X1),converse(X2))=converse(composition(X2,X1)))).
% 0.13/0.39 cnf(i_0_2, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))).
% 0.13/0.39 cnf(i_0_13, plain, (complement(top)=zero)).
% 0.13/0.39 cnf(i_0_5, plain, (composition(composition(X1,X2),X3)=composition(X1,composition(X2,X3)))).
% 0.13/0.39 cnf(i_0_7, plain, (join(composition(X1,X2),composition(X3,X2))=composition(join(X1,X3),X2))).
% 0.13/0.39 cnf(i_0_11, plain, (join(complement(X1),composition(converse(X2),complement(composition(X2,X1))))=complement(X1))).
% 0.13/0.39 cnf(i_0_3, plain, (join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1)).
% 0.13/0.39 cnf(i_0_1, plain, (join(X1,X2)=join(X2,X1))).
% 0.13/0.39 cnf(i_0_14, negated_conjecture, (converse(join(esk2_0,esk1_0))!=converse(esk2_0)|join(esk2_0,esk1_0)!=esk2_0)).
% 0.13/0.39 cnf(i_0_17, negated_conjecture, (converse(join(esk2_0,esk1_0))=converse(esk2_0)|join(esk2_0,esk1_0)=esk2_0)).
% 0.13/0.39 cnf(i_0_38, plain, (X31=X31)).
% 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.39 # Begin printing tableau
% 0.13/0.39 # Found 6 steps
% 0.13/0.39 cnf(i_0_8, plain, (converse(converse(X3))=X3), inference(start_rule)).
% 0.13/0.39 cnf(i_0_46, plain, (converse(converse(X3))=X3), inference(extension_rule, [i_0_44])).
% 0.13/0.39 cnf(i_0_81, plain, (converse(converse(X5))!=X5), inference(closure_rule, [i_0_8])).
% 0.13/0.39 cnf(i_0_79, plain, (composition(converse(converse(X3)),converse(converse(X5)))=composition(X3,X5)), inference(extension_rule, [i_0_41])).
% 0.13/0.39 cnf(i_0_94, plain, (composition(X3,X5)!=converse(converse(composition(X3,X5)))), inference(closure_rule, [i_0_8])).
% 0.13/0.39 cnf(i_0_92, plain, (composition(converse(converse(X3)),converse(converse(X5)))=converse(converse(composition(X3,X5)))), inference(etableau_closure_rule, [i_0_92, ...])).
% 0.13/0.39 # End printing tableau
% 0.13/0.39 # SZS output end
% 0.13/0.39 # Branches closed with saturation will be marked with an "s"
% 0.13/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # Begin clausification derivation
% 0.13/0.39
% 0.13/0.39 # End clausification derivation
% 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.39 cnf(i_0_8, plain, (converse(converse(X1))=X1)).
% 0.13/0.39 cnf(i_0_6, plain, (composition(X1,one)=X1)).
% 0.13/0.39 cnf(i_0_12, plain, (join(X1,complement(X1))=top)).
% 0.13/0.39 cnf(i_0_9, plain, (join(converse(X1),converse(X2))=converse(join(X1,X2)))).
% 0.13/0.39 cnf(i_0_10, plain, (composition(converse(X1),converse(X2))=converse(composition(X2,X1)))).
% 0.13/0.39 cnf(i_0_2, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))).
% 0.13/0.39 cnf(i_0_13, plain, (complement(top)=zero)).
% 0.13/0.39 cnf(i_0_5, plain, (composition(composition(X1,X2),X3)=composition(X1,composition(X2,X3)))).
% 0.13/0.39 cnf(i_0_7, plain, (join(composition(X1,X2),composition(X3,X2))=composition(join(X1,X3),X2))).
% 0.13/0.39 cnf(i_0_11, plain, (join(complement(X1),composition(converse(X2),complement(composition(X2,X1))))=complement(X1))).
% 0.13/0.39 cnf(i_0_3, plain, (join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1)).
% 0.13/0.39 cnf(i_0_1, plain, (join(X1,X2)=join(X2,X1))).
% 0.13/0.39 cnf(i_0_14, negated_conjecture, (converse(join(esk2_0,esk1_0))!=converse(esk2_0)|join(esk2_0,esk1_0)!=esk2_0)).
% 0.13/0.39 cnf(i_0_17, negated_conjecture, (converse(join(esk2_0,esk1_0))=converse(esk2_0)|join(esk2_0,esk1_0)=esk2_0)).
% 0.13/0.39 cnf(i_0_38, plain, (X31=X31)).
% 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.39 # Begin printing tableau
% 0.13/0.39 # Found 5 steps
% 0.13/0.39 cnf(i_0_8, plain, (converse(converse(converse(X4)))=converse(X4)), inference(start_rule)).
% 0.13/0.39 cnf(i_0_46, plain, (converse(converse(converse(X4)))=converse(X4)), inference(extension_rule, [i_0_45])).
% 0.13/0.39 cnf(i_0_82, plain, (converse(converse(converse(converse(X4))))=converse(converse(X4))), inference(extension_rule, [i_0_41])).
% 0.13/0.39 cnf(i_0_94, plain, (converse(converse(X4))!=X4), inference(closure_rule, [i_0_8])).
% 0.13/0.39 cnf(i_0_92, plain, (converse(converse(converse(converse(X4))))=X4), inference(etableau_closure_rule, [i_0_92, ...])).
% 0.13/0.39 # End printing tableau
% 0.13/0.39 # SZS output end
% 0.13/0.39 # Branches closed with saturation will be marked with an "s"
% 0.13/0.39 # Child (10611) has found a proof.
% 0.13/0.39 # There were 1 total branch saturation attempts.
% 0.13/0.39 # There were 0 of these attempts blocked.
% 0.13/0.39 # There were 0 deferred branch saturation attempts.
% 0.13/0.39 # There were 0 free duplicated saturations.
% 0.13/0.39 # There were 1 total successful branch saturations.
% 0.13/0.39 # There were 0 successful branch saturations in interreduction.
% 0.13/0.39 # There were 0 successful branch saturations on the branch.
% 0.13/0.39 # There were 1 successful branch saturations after the branch.
% 0.13/0.39
% 0.13/0.39 # Proof search is over...
% 0.13/0.39 # Freeing feature tree
%------------------------------------------------------------------------------