%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LAT239-1 : TPTP v8.1.0. Released v3.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 : n007.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 : Sun Jul 17 04:49:40 EDT 2022 % Result : Unsatisfiable 0.20s 0.58s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : LAT239-1 : TPTP v8.1.0. Released v3.1.0. % 0.08/0.13 % 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 : n007.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 : Tue Jun 28 20:02:07 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.38 # No SInE strategy applied % 0.13/0.38 # Auto-Mode selected heuristic G_____X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S % 0.13/0.38 # and selection function SelectNewComplexAHP. % 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 1 conjectures. % 0.13/0.38 # There are 1 start rule candidates: % 0.13/0.38 # Found 13 unit axioms. % 0.13/0.38 # 1 start rule tableaux created. % 0.13/0.38 # 1 extension rule candidate clauses % 0.13/0.38 # 13 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 1 % 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 22 new_tableaux and 0 remaining starting tableaux. % 0.13/0.38 # We now have 22 tableaux to operate on % 0.20/0.58 # There were 1 total branch saturation attempts. % 0.20/0.58 # There were 0 of these attempts blocked. % 0.20/0.58 # There were 0 deferred branch saturation attempts. % 0.20/0.58 # There were 0 free duplicated saturations. % 0.20/0.58 # There were 1 total successful branch saturations. % 0.20/0.58 # There were 0 successful branch saturations in interreduction. % 0.20/0.58 # There were 0 successful branch saturations on the branch. % 0.20/0.58 # There were 1 successful branch saturations after the branch. % 0.20/0.58 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.58 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.58 # Begin clausification derivation % 0.20/0.58 % 0.20/0.58 # End clausification derivation % 0.20/0.58 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.58 cnf(i_0_24, plain, (meet(X1,complement(X1))=zero)). % 0.20/0.58 cnf(i_0_23, plain, (join(X1,complement(X1))=one)). % 0.20/0.58 cnf(i_0_15, plain, (meet(X1,X1)=X1)). % 0.20/0.58 cnf(i_0_16, plain, (join(X1,X1)=X1)). % 0.20/0.58 cnf(i_0_17, plain, (meet(X1,join(X1,X2))=X1)). % 0.20/0.58 cnf(i_0_18, plain, (join(X1,meet(X1,X2))=X1)). % 0.20/0.58 cnf(i_0_27, hypothesis, (meet(a,b)=a)). % 0.20/0.58 cnf(i_0_21, plain, (meet(meet(X1,X2),X3)=meet(X1,meet(X2,X3)))). % 0.20/0.58 cnf(i_0_22, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))). % 0.20/0.58 cnf(i_0_26, plain, (meet(X1,join(X2,join(meet(X1,X3),meet(X3,join(X2,X4)))))=meet(X1,join(X2,meet(X3,join(X1,X4)))))). % 0.20/0.58 cnf(i_0_19, plain, (meet(X1,X2)=meet(X2,X1))). % 0.20/0.58 cnf(i_0_20, plain, (join(X1,X2)=join(X2,X1))). % 0.20/0.58 cnf(i_0_28, negated_conjecture, (join(complement(a),complement(b))!=complement(a))). % 0.20/0.58 cnf(i_0_25, plain, (complement(X1)=X2|meet(X1,X2)!=zero|join(X1,X2)!=one)). % 0.20/0.58 cnf(i_0_39, plain, (X5=X5)). % 0.20/0.58 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.58 # Begin printing tableau % 0.20/0.58 # Found 6 steps % 0.20/0.58 cnf(i_0_24, plain, (meet(a,complement(a))=zero), inference(start_rule)). % 0.20/0.58 cnf(i_0_46, plain, (meet(a,complement(a))=zero), inference(extension_rule, [i_0_25])). % 0.20/0.58 cnf(i_0_65, plain, (join(a,complement(a))!=one), inference(closure_rule, [i_0_23])). % 0.20/0.58 cnf(i_0_63, plain, (complement(a)=complement(a)), inference(extension_rule, [i_0_42])). % 0.20/0.58 cnf(i_0_88, plain, (complement(a)=join(complement(a),complement(b))), inference(closure_rule, [i_0_28])). % 0.20/0.58 cnf(i_0_90, plain, (complement(a)!=join(complement(a),complement(b))), inference(etableau_closure_rule, [i_0_90, ...])). % 0.20/0.58 # End printing tableau % 0.20/0.58 # SZS output end % 0.20/0.58 # Branches closed with saturation will be marked with an "s" % 0.20/0.59 # Child (4339) has found a proof. % 0.20/0.59 % 0.20/0.59 # Proof search is over... % 0.20/0.59 # Freeing feature tree %------------------------------------------------------------------------------